{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:B6FLFL3KFQS44E2ZWOIZFF26XL","short_pith_number":"pith:B6FLFL3K","schema_version":"1.0","canonical_sha256":"0f8ab2af6a2c25ce1359b39192975ebac02be0dde54dc99096324ef70506d834","source":{"kind":"arxiv","id":"1801.08098","version":1},"attestation_state":"computed","paper":{"title":"A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erin Fitzhenry, George Chin Jr, Katherine Porterfield, Patrick Mackey, Sutanay Choudhury","submitted_at":"2018-01-24T17:48:55Z","abstract_excerpt":"Many real world networks are considered temporal networks, in which the chronological ordering of the edges has importance to the meaning of the data. Performing temporal subgraph matching on such graphs requires the edges in the subgraphs to match the order of the temporal graph motif we are searching for. Previous methods for solving this rely on the use of static subgraph matching to find potential matches first, before filtering them based on edge order to find the true temporal matches. We present a new algorithm for temporal subgraph isomorphism that performs the subgraph matching direct"},"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":"1801.08098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-24T17:48:55Z","cross_cats_sorted":[],"title_canon_sha256":"0a76399281b9668ab58b95e46cb7f5c429050a206679eab4abc4990c8833c6c0","abstract_canon_sha256":"c19b260091c726a09a6026477753222832fa866b309ac6880d670fe545c3fab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:08.358494Z","signature_b64":"Auwyi81vbwbuHCqtuhnc5pTu3q+cUy56iLjy2Nlo3/qDwMnSuyW4L3e1N4Itu9l3/xZie5sHEw9pxvK93RS0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f8ab2af6a2c25ce1359b39192975ebac02be0dde54dc99096324ef70506d834","last_reissued_at":"2026-05-18T00:25:08.358005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:08.358005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Chronological Edge-Driven Approach to Temporal Subgraph Isomorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Erin Fitzhenry, George Chin Jr, Katherine Porterfield, Patrick Mackey, Sutanay Choudhury","submitted_at":"2018-01-24T17:48:55Z","abstract_excerpt":"Many real world networks are considered temporal networks, in which the chronological ordering of the edges has importance to the meaning of the data. Performing temporal subgraph matching on such graphs requires the edges in the subgraphs to match the order of the temporal graph motif we are searching for. Previous methods for solving this rely on the use of static subgraph matching to find potential matches first, before filtering them based on edge order to find the true temporal matches. We present a new algorithm for temporal subgraph isomorphism that performs the subgraph matching direct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08098","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":""},"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":"1801.08098","created_at":"2026-05-18T00:25:08.358080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08098v1","created_at":"2026-05-18T00:25:08.358080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08098","created_at":"2026-05-18T00:25:08.358080+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6FLFL3KFQS4","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6FLFL3KFQS44E2Z","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6FLFL3K","created_at":"2026-05-18T12:32:13.499390+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/B6FLFL3KFQS44E2ZWOIZFF26XL","json":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL.json","graph_json":"https://pith.science/api/pith-number/B6FLFL3KFQS44E2ZWOIZFF26XL/graph.json","events_json":"https://pith.science/api/pith-number/B6FLFL3KFQS44E2ZWOIZFF26XL/events.json","paper":"https://pith.science/paper/B6FLFL3K"},"agent_actions":{"view_html":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL","download_json":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL.json","view_paper":"https://pith.science/paper/B6FLFL3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08098&json=true","fetch_graph":"https://pith.science/api/pith-number/B6FLFL3KFQS44E2ZWOIZFF26XL/graph.json","fetch_events":"https://pith.science/api/pith-number/B6FLFL3KFQS44E2ZWOIZFF26XL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL/action/storage_attestation","attest_author":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL/action/author_attestation","sign_citation":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL/action/citation_signature","submit_replication":"https://pith.science/pith/B6FLFL3KFQS44E2ZWOIZFF26XL/action/replication_record"}},"created_at":"2026-05-18T00:25:08.358080+00:00","updated_at":"2026-05-18T00:25:08.358080+00:00"}