{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PDITXOS3UVLJSWST2RFCR2UKTI","short_pith_number":"pith:PDITXOS3","schema_version":"1.0","canonical_sha256":"78d13bba5ba556995a53d44a28ea8a9a3aff5dc007eaa1c6c4fc8afd8c02f1b8","source":{"kind":"arxiv","id":"2208.06794","version":1},"attestation_state":"computed","paper":{"title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chen Gao, Depeng Jin, Quanming Yao, Tong Li, Yinfeng Li, Yong Li","submitted_at":"2022-08-14T06:51:54Z","abstract_excerpt":"Spatiotemporal activity prediction, aiming to predict user activities at a specific location and time, is crucial for applications like urban planning and mobile advertising. Existing solutions based on tensor decomposition or graph embedding suffer from the following two major limitations: 1) ignoring the fine-grained similarities of user preferences; 2) user's modeling is entangled. In this work, we propose a hypergraph neural network model called DisenHCN to bridge the above gaps. In particular, we first unify the fine-grained user similarity and the complex matching between user preference"},"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":"2208.06794","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-08-14T06:51:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4bac224b9cdcfecceed034081b006f1ffc05fd501e8f594740a5e838bc67e4eb","abstract_canon_sha256":"2302e39741872de654a0730e135184e95fd95f04a0dcbf8fc02a1a883f694c3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:20.804231Z","signature_b64":"2KNI6XejimHts3+w5BDXx4ZORc4i8m3pKV/j9O2r2T9J43Z6cFLo+CGWrZsDMVo9KJxUjBw2h2+EaGYdRLqLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78d13bba5ba556995a53d44a28ea8a9a3aff5dc007eaa1c6c4fc8afd8c02f1b8","last_reissued_at":"2026-07-05T04:48:20.803892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:20.803892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DisenHCN: Disentangled Hypergraph Convolutional Networks for Spatiotemporal Activity Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chen Gao, Depeng Jin, Quanming Yao, Tong Li, Yinfeng Li, Yong Li","submitted_at":"2022-08-14T06:51:54Z","abstract_excerpt":"Spatiotemporal activity prediction, aiming to predict user activities at a specific location and time, is crucial for applications like urban planning and mobile advertising. Existing solutions based on tensor decomposition or graph embedding suffer from the following two major limitations: 1) ignoring the fine-grained similarities of user preferences; 2) user's modeling is entangled. In this work, we propose a hypergraph neural network model called DisenHCN to bridge the above gaps. In particular, we first unify the fine-grained user similarity and the complex matching between user preference"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.06794","kind":"arxiv","version":1},"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/2208.06794/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":"2208.06794","created_at":"2026-07-05T04:48:20.803953+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.06794v1","created_at":"2026-07-05T04:48:20.803953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.06794","created_at":"2026-07-05T04:48:20.803953+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDITXOS3UVLJ","created_at":"2026-07-05T04:48:20.803953+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDITXOS3UVLJSWST","created_at":"2026-07-05T04:48:20.803953+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDITXOS3","created_at":"2026-07-05T04:48:20.803953+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02713","citing_title":"Open-Set Living Need Prediction with Large Language Models","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI","json":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI.json","graph_json":"https://pith.science/api/pith-number/PDITXOS3UVLJSWST2RFCR2UKTI/graph.json","events_json":"https://pith.science/api/pith-number/PDITXOS3UVLJSWST2RFCR2UKTI/events.json","paper":"https://pith.science/paper/PDITXOS3"},"agent_actions":{"view_html":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI","download_json":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI.json","view_paper":"https://pith.science/paper/PDITXOS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.06794&json=true","fetch_graph":"https://pith.science/api/pith-number/PDITXOS3UVLJSWST2RFCR2UKTI/graph.json","fetch_events":"https://pith.science/api/pith-number/PDITXOS3UVLJSWST2RFCR2UKTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI/action/storage_attestation","attest_author":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI/action/author_attestation","sign_citation":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI/action/citation_signature","submit_replication":"https://pith.science/pith/PDITXOS3UVLJSWST2RFCR2UKTI/action/replication_record"}},"created_at":"2026-07-05T04:48:20.803953+00:00","updated_at":"2026-07-05T04:48:20.803953+00:00"}