{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7SS5M5RPTOMI5NLPFJMU226IQ2","short_pith_number":"pith:7SS5M5RP","schema_version":"1.0","canonical_sha256":"fca5d6762f9b988eb56f2a594d6bc886b23d5885acd8a903b96d6539903c97dc","source":{"kind":"arxiv","id":"2607.23556","version":1},"attestation_state":"computed","paper":{"title":"GTIN: A Unified Framework for Joint Event and Time Prediction in Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Hamid R. Rabiee, Mohammad Ostadmohammadi, Sepehr kazemi","submitted_at":"2026-07-26T09:15:27Z","abstract_excerpt":"Temporal graphs are increasingly used to model dynamic systems in diverse domains such as social networks, financial networks, and traffic networks. Predicting both what the next event will be and when it will occur in these systems is crucial for understanding and anticipating complex behaviors, but has not been studied much. To address this gap, we propose a unified mathematical framework capable of capturing varying degrees of complexity across temporal graphs. Our framework is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics. Building u"},"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":"2607.23556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-07-26T09:15:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e3bf55a8c9e8364f6bbda7682155de19073817eee4bb2962831a7c8009556ef8","abstract_canon_sha256":"5166c6626ddfcd010d528a4d1805a7fa7ea57ff43fb761dfdfd5a3fac173f13b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:22:59.265974Z","signature_b64":"JlyKsp2SGhJvxVKvB3Epltn5JLsHoVnqVrt3ftTypGHMBqMaO87UprprY8PnqjyCnBSHo5TIXzV0kKZ+1zwdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fca5d6762f9b988eb56f2a594d6bc886b23d5885acd8a903b96d6539903c97dc","last_reissued_at":"2026-07-28T01:22:59.265102Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:22:59.265102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GTIN: A Unified Framework for Joint Event and Time Prediction in Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SI","authors_text":"Hamid R. Rabiee, Mohammad Ostadmohammadi, Sepehr kazemi","submitted_at":"2026-07-26T09:15:27Z","abstract_excerpt":"Temporal graphs are increasingly used to model dynamic systems in diverse domains such as social networks, financial networks, and traffic networks. Predicting both what the next event will be and when it will occur in these systems is crucial for understanding and anticipating complex behaviors, but has not been studied much. To address this gap, we propose a unified mathematical framework capable of capturing varying degrees of complexity across temporal graphs. Our framework is flexible and expressive enough to accommodate a wide range of network structures and temporal dynamics. Building u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23556","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/2607.23556/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":"2607.23556","created_at":"2026-07-28T01:22:59.265571+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23556v1","created_at":"2026-07-28T01:22:59.265571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23556","created_at":"2026-07-28T01:22:59.265571+00:00"},{"alias_kind":"pith_short_12","alias_value":"7SS5M5RPTOMI","created_at":"2026-07-28T01:22:59.265571+00:00"},{"alias_kind":"pith_short_16","alias_value":"7SS5M5RPTOMI5NLP","created_at":"2026-07-28T01:22:59.265571+00:00"},{"alias_kind":"pith_short_8","alias_value":"7SS5M5RP","created_at":"2026-07-28T01:22:59.265571+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2","json":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2.json","graph_json":"https://pith.science/api/pith-number/7SS5M5RPTOMI5NLPFJMU226IQ2/graph.json","events_json":"https://pith.science/api/pith-number/7SS5M5RPTOMI5NLPFJMU226IQ2/events.json","paper":"https://pith.science/paper/7SS5M5RP"},"agent_actions":{"view_html":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2","download_json":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2.json","view_paper":"https://pith.science/paper/7SS5M5RP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23556&json=true","fetch_graph":"https://pith.science/api/pith-number/7SS5M5RPTOMI5NLPFJMU226IQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/7SS5M5RPTOMI5NLPFJMU226IQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2/action/storage_attestation","attest_author":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2/action/author_attestation","sign_citation":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2/action/citation_signature","submit_replication":"https://pith.science/pith/7SS5M5RPTOMI5NLPFJMU226IQ2/action/replication_record"}},"created_at":"2026-07-28T01:22:59.265571+00:00","updated_at":"2026-07-28T01:22:59.265571+00:00"}