{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5TQ23VD25ZACOH7XS5IEN3OLV7","short_pith_number":"pith:5TQ23VD2","schema_version":"1.0","canonical_sha256":"ece1add47aee40271ff7975046edcbafd6b0987eccae8b3a2f1c443991a524d5","source":{"kind":"arxiv","id":"2508.18151","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Historical K-Core Search in Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dong Wen, Kaiyu Chen, Wenjie Zhang, Xuemin Lin, Yixiang Fang, Zhuo Ma","submitted_at":"2025-08-25T15:57:28Z","abstract_excerpt":"We study the temporal k-core component search (TCCS), which outputs the k-core containing the query vertex in the snapshot over an arbitrary query time window in a temporal graph. The problem has been shown to be critical for tasks such as contact tracing, fault diagnosis, and financial forensics. The state-of-the-art EF-Index designs a separated forest structure for a set of carefully selected windows, incurring quadratic preprocessing time and large redundant storage. Our method introduces the ECB-forest, a compact edge-centric binary forest that captures k-core of any arbitrary query vertex"},"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.18151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-08-25T15:57:28Z","cross_cats_sorted":[],"title_canon_sha256":"a09e8e173d23c9cf154e12773fb4cc051d79ebc9fe8598fae66d6cc2f5f1bd7e","abstract_canon_sha256":"c9115dec59086045ada607162fb89cc830790c6f17a73af16ccbf683eb245e2e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:58:54.566762Z","signature_b64":"K4nKPNryMtH4ZyuBlxRwk+yy8UgqL6bNDH1o85LdUYWtSN5dqeT7FNlaUaWfSwnzOWWfic3Tw+bRpxQxHfydDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ece1add47aee40271ff7975046edcbafd6b0987eccae8b3a2f1c443991a524d5","last_reissued_at":"2026-07-05T11:58:54.566335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:58:54.566335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Historical K-Core Search in Temporal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dong Wen, Kaiyu Chen, Wenjie Zhang, Xuemin Lin, Yixiang Fang, Zhuo Ma","submitted_at":"2025-08-25T15:57:28Z","abstract_excerpt":"We study the temporal k-core component search (TCCS), which outputs the k-core containing the query vertex in the snapshot over an arbitrary query time window in a temporal graph. The problem has been shown to be critical for tasks such as contact tracing, fault diagnosis, and financial forensics. The state-of-the-art EF-Index designs a separated forest structure for a set of carefully selected windows, incurring quadratic preprocessing time and large redundant storage. Our method introduces the ECB-forest, a compact edge-centric binary forest that captures k-core of any arbitrary query vertex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.18151","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.18151/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.18151","created_at":"2026-07-05T11:58:54.566401+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.18151v1","created_at":"2026-07-05T11:58:54.566401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.18151","created_at":"2026-07-05T11:58:54.566401+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TQ23VD25ZAC","created_at":"2026-07-05T11:58:54.566401+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TQ23VD25ZACOH7X","created_at":"2026-07-05T11:58:54.566401+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TQ23VD2","created_at":"2026-07-05T11:58:54.566401+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/5TQ23VD25ZACOH7XS5IEN3OLV7","json":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7.json","graph_json":"https://pith.science/api/pith-number/5TQ23VD25ZACOH7XS5IEN3OLV7/graph.json","events_json":"https://pith.science/api/pith-number/5TQ23VD25ZACOH7XS5IEN3OLV7/events.json","paper":"https://pith.science/paper/5TQ23VD2"},"agent_actions":{"view_html":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7","download_json":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7.json","view_paper":"https://pith.science/paper/5TQ23VD2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.18151&json=true","fetch_graph":"https://pith.science/api/pith-number/5TQ23VD25ZACOH7XS5IEN3OLV7/graph.json","fetch_events":"https://pith.science/api/pith-number/5TQ23VD25ZACOH7XS5IEN3OLV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7/action/storage_attestation","attest_author":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7/action/author_attestation","sign_citation":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7/action/citation_signature","submit_replication":"https://pith.science/pith/5TQ23VD25ZACOH7XS5IEN3OLV7/action/replication_record"}},"created_at":"2026-07-05T11:58:54.566401+00:00","updated_at":"2026-07-05T11:58:54.566401+00:00"}