{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MMTWT2FMMVOSNDKZP5HQZ4NRK3","short_pith_number":"pith:MMTWT2FM","schema_version":"1.0","canonical_sha256":"632769e8ac655d268d597f4f0cf1b156ee81cc45b6f48c2cd031a905d4858f06","source":{"kind":"arxiv","id":"2401.02130","version":4},"attestation_state":"computed","paper":{"title":"Spectral-Based Graph Neural Networks for Complementary Item Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Haitong Luo, Hanyun Cao, Suhang Wang, Weiyao Zhang, Xuying Meng, Yequan Wang, Yujun Zhang","submitted_at":"2024-01-04T08:31:47Z","abstract_excerpt":"Modeling complementary relationships greatly helps recommender systems to accurately and promptly recommend the subsequent items when one item is purchased. Unlike traditional similar relationships, items with complementary relationships may be purchased successively (such as iPhone and Airpods Pro), and they not only share relevance but also exhibit dissimilarity. Since the two attributes are opposites, modeling complementary relationships is challenging. Previous attempts to exploit these relationships have either ignored or oversimplified the dissimilarity attribute, resulting in ineffectiv"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2401.02130","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-01-04T08:31:47Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"77c5724d75235dd458caaa2ae42f86bae5eabc7d7ecc0c35861a82a6597f503d","abstract_canon_sha256":"b44213220eaa0fd81812858caf529f864ec9f3b76b79831c2e1182c64c4b6a8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:39.099882Z","signature_b64":"BqIiAMbI8pG4wVAU4PTkKw9MsMUTW1ew61X53aPIxmPELGFf/LbA3Awm53OoUFIXE91jOxK5yxwQI070WPM+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"632769e8ac655d268d597f4f0cf1b156ee81cc45b6f48c2cd031a905d4858f06","last_reissued_at":"2026-07-05T09:20:39.099399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:39.099399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral-Based Graph Neural Networks for Complementary Item Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.IR","authors_text":"Haitong Luo, Hanyun Cao, Suhang Wang, Weiyao Zhang, Xuying Meng, Yequan Wang, Yujun Zhang","submitted_at":"2024-01-04T08:31:47Z","abstract_excerpt":"Modeling complementary relationships greatly helps recommender systems to accurately and promptly recommend the subsequent items when one item is purchased. Unlike traditional similar relationships, items with complementary relationships may be purchased successively (such as iPhone and Airpods Pro), and they not only share relevance but also exhibit dissimilarity. Since the two attributes are opposites, modeling complementary relationships is challenging. Previous attempts to exploit these relationships have either ignored or oversimplified the dissimilarity attribute, resulting in ineffectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02130","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.02130/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.02130","created_at":"2026-07-05T09:20:39.099458+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.02130v4","created_at":"2026-07-05T09:20:39.099458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02130","created_at":"2026-07-05T09:20:39.099458+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMTWT2FMMVOS","created_at":"2026-07-05T09:20:39.099458+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMTWT2FMMVOSNDKZ","created_at":"2026-07-05T09:20:39.099458+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMTWT2FM","created_at":"2026-07-05T09:20:39.099458+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.05564","citing_title":"Knowledge-Augmented Relation Learning for Complementary Recommendation with Large Language Models","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3","json":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3.json","graph_json":"https://pith.science/api/pith-number/MMTWT2FMMVOSNDKZP5HQZ4NRK3/graph.json","events_json":"https://pith.science/api/pith-number/MMTWT2FMMVOSNDKZP5HQZ4NRK3/events.json","paper":"https://pith.science/paper/MMTWT2FM"},"agent_actions":{"view_html":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3","download_json":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3.json","view_paper":"https://pith.science/paper/MMTWT2FM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.02130&json=true","fetch_graph":"https://pith.science/api/pith-number/MMTWT2FMMVOSNDKZP5HQZ4NRK3/graph.json","fetch_events":"https://pith.science/api/pith-number/MMTWT2FMMVOSNDKZP5HQZ4NRK3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3/action/storage_attestation","attest_author":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3/action/author_attestation","sign_citation":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3/action/citation_signature","submit_replication":"https://pith.science/pith/MMTWT2FMMVOSNDKZP5HQZ4NRK3/action/replication_record"}},"created_at":"2026-07-05T09:20:39.099458+00:00","updated_at":"2026-07-05T09:20:39.099458+00:00"}