{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UX47DFDFITOYJDORONYVQCMGWJ","short_pith_number":"pith:UX47DFDF","schema_version":"1.0","canonical_sha256":"a5f9f1946544dd848dd17371580986b27e7137403abeafcb658a43dd857724a9","source":{"kind":"arxiv","id":"1812.08615","version":2},"attestation_state":"computed","paper":{"title":"Temporal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antoine Roux, Binh-Minh Bui-Xuan, Julien Baste","submitted_at":"2018-12-20T14:51:49Z","abstract_excerpt":"A link stream is a sequence of pairs of the form $(t,\\{u,v\\})$, where $t\\in\\mathbb N$ represents a time instant and $u\\neq v$. Given an integer $\\gamma$, the $\\gamma$-edge between vertices $u$ and $v$, starting at time $t$, is the set of temporally consecutive edges defined by $\\{(t',\\{u,v\\}) | t' \\in [t,t+\\gamma-1]\\}$. We introduce the notion of temporal matching of a link stream to be an independent $\\gamma$-edge set belonging to the link stream. We show that the problem of computing a temporal matching of maximum size is NP-hard as soon as $\\gamma>1$. We depict a kernelization algorithm par"},"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":"1812.08615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-20T14:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"2aaf11a3f0543045d8b8ca84efbb9a95067f660a31b19f425a6ec27dec267ed6","abstract_canon_sha256":"88b6465189e2dd5459fe022a758e04a61031c81fc0d98176d8125d103ca965af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:33.921684Z","signature_b64":"DJPjqx3vEjDxSRZnepo6pcCGTK1hkVOl7Lzdsi7z0dQMmGeU1a9ffyF7I8/F1al8HXXXVrdsEaQQbPRzYqzOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5f9f1946544dd848dd17371580986b27e7137403abeafcb658a43dd857724a9","last_reissued_at":"2026-05-17T23:54:33.920776Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:33.920776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antoine Roux, Binh-Minh Bui-Xuan, Julien Baste","submitted_at":"2018-12-20T14:51:49Z","abstract_excerpt":"A link stream is a sequence of pairs of the form $(t,\\{u,v\\})$, where $t\\in\\mathbb N$ represents a time instant and $u\\neq v$. Given an integer $\\gamma$, the $\\gamma$-edge between vertices $u$ and $v$, starting at time $t$, is the set of temporally consecutive edges defined by $\\{(t',\\{u,v\\}) | t' \\in [t,t+\\gamma-1]\\}$. We introduce the notion of temporal matching of a link stream to be an independent $\\gamma$-edge set belonging to the link stream. We show that the problem of computing a temporal matching of maximum size is NP-hard as soon as $\\gamma>1$. We depict a kernelization algorithm par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08615","kind":"arxiv","version":2},"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":"1812.08615","created_at":"2026-05-17T23:54:33.920937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08615v2","created_at":"2026-05-17T23:54:33.920937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08615","created_at":"2026-05-17T23:54:33.920937+00:00"},{"alias_kind":"pith_short_12","alias_value":"UX47DFDFITOY","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UX47DFDFITOYJDOR","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UX47DFDF","created_at":"2026-05-18T12:32:56.356000+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/UX47DFDFITOYJDORONYVQCMGWJ","json":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ.json","graph_json":"https://pith.science/api/pith-number/UX47DFDFITOYJDORONYVQCMGWJ/graph.json","events_json":"https://pith.science/api/pith-number/UX47DFDFITOYJDORONYVQCMGWJ/events.json","paper":"https://pith.science/paper/UX47DFDF"},"agent_actions":{"view_html":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ","download_json":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ.json","view_paper":"https://pith.science/paper/UX47DFDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08615&json=true","fetch_graph":"https://pith.science/api/pith-number/UX47DFDFITOYJDORONYVQCMGWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/UX47DFDFITOYJDORONYVQCMGWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ/action/storage_attestation","attest_author":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ/action/author_attestation","sign_citation":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ/action/citation_signature","submit_replication":"https://pith.science/pith/UX47DFDFITOYJDORONYVQCMGWJ/action/replication_record"}},"created_at":"2026-05-17T23:54:33.920937+00:00","updated_at":"2026-05-17T23:54:33.920937+00:00"}