{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TVYWHZ3IACTSEGZ4GQ6DEMVUN6","short_pith_number":"pith:TVYWHZ3I","schema_version":"1.0","canonical_sha256":"9d7163e76800a7221b3c343c3232b46fb23c07dd9c651b0701ee2332da576078","source":{"kind":"arxiv","id":"2508.15238","version":1},"attestation_state":"computed","paper":{"title":"Temporal $k$-Core Query, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Cheng Long, Kaiqiang Yu, Shengxin Liu, Yinyu Liu, Zhaoquan Gu","submitted_at":"2025-08-21T04:53:00Z","abstract_excerpt":"Querying cohesive subgraphs in temporal graphs is essential for understanding the dynamic structure of real-world networks, such as evolving communities in social platforms, shifting hyperlink structures on the Web, and transient communication patterns in call networks. Recently, research has focused on the temporal $k$-core query, which aims to identify all $k$-cores across all possible time sub-intervals within a given query interval. The state-of-the-art algorithm OTCD mitigates redundant computations over overlapping sub-intervals by exploiting inclusion relationships among $k$-cores in di"},"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":"2508.15238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-08-21T04:53:00Z","cross_cats_sorted":[],"title_canon_sha256":"8b3afbe6511637ae6639098d3caa1358b0034b146d804c557d20d779f13579df","abstract_canon_sha256":"f9ce4361c2ed69bf952ca150d984f16ab0a0fb0b4b603787e196ceef119bf35e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:57:08.769265Z","signature_b64":"rDmUgWp3JjazEcsF8MCWrTpKrsOF0BnjUyOfhaTxAHOFsnuwv7QfbcdQd07Wcpqa52SNr+YJMHAA41Xt1jtpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d7163e76800a7221b3c343c3232b46fb23c07dd9c651b0701ee2332da576078","last_reissued_at":"2026-07-05T11:57:08.768750Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:57:08.768750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal $k$-Core Query, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Cheng Long, Kaiqiang Yu, Shengxin Liu, Yinyu Liu, Zhaoquan Gu","submitted_at":"2025-08-21T04:53:00Z","abstract_excerpt":"Querying cohesive subgraphs in temporal graphs is essential for understanding the dynamic structure of real-world networks, such as evolving communities in social platforms, shifting hyperlink structures on the Web, and transient communication patterns in call networks. Recently, research has focused on the temporal $k$-core query, which aims to identify all $k$-cores across all possible time sub-intervals within a given query interval. The state-of-the-art algorithm OTCD mitigates redundant computations over overlapping sub-intervals by exploiting inclusion relationships among $k$-cores in di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.15238","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/2508.15238/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":"2508.15238","created_at":"2026-07-05T11:57:08.768816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.15238v1","created_at":"2026-07-05T11:57:08.768816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.15238","created_at":"2026-07-05T11:57:08.768816+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVYWHZ3IACTS","created_at":"2026-07-05T11:57:08.768816+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVYWHZ3IACTSEGZ4","created_at":"2026-07-05T11:57:08.768816+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVYWHZ3I","created_at":"2026-07-05T11:57:08.768816+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/TVYWHZ3IACTSEGZ4GQ6DEMVUN6","json":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6.json","graph_json":"https://pith.science/api/pith-number/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/graph.json","events_json":"https://pith.science/api/pith-number/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/events.json","paper":"https://pith.science/paper/TVYWHZ3I"},"agent_actions":{"view_html":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6","download_json":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6.json","view_paper":"https://pith.science/paper/TVYWHZ3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.15238&json=true","fetch_graph":"https://pith.science/api/pith-number/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/graph.json","fetch_events":"https://pith.science/api/pith-number/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/action/storage_attestation","attest_author":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/action/author_attestation","sign_citation":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/action/citation_signature","submit_replication":"https://pith.science/pith/TVYWHZ3IACTSEGZ4GQ6DEMVUN6/action/replication_record"}},"created_at":"2026-07-05T11:57:08.768816+00:00","updated_at":"2026-07-05T11:57:08.768816+00:00"}