{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QMFMFWMK42E3LKKWKJFRTNJHMC","short_pith_number":"pith:QMFMFWMK","schema_version":"1.0","canonical_sha256":"830ac2d98ae689b5a956524b19b527608fc7556a0182605df640f446c62df7e1","source":{"kind":"arxiv","id":"2606.06364","version":1},"attestation_state":"computed","paper":{"title":"End-to-End Subgraph Detection with GraphDETR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dexiong Chen, Karsten Borgwardt, Till Hendrik Schulz","submitted_at":"2026-06-04T16:33:15Z","abstract_excerpt":"Subgraph detection seeks to identify whether and where instances of query patterns occur within a larger graph. This problem is fundamental across scientific domains and is closely related to subgraph isomorphism, which is NP-complete, limiting combinatorial approaches to small patterns or moderately sized graphs. We introduce GraphDETR, a deep learning framework that formulates subgraph detection as a set prediction problem, analogous to DETR in object detection. GraphDETR encodes the target graph with a graph neural network, and employs a fixed set of learnable query vectors, decoded via a t"},"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":"2606.06364","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-04T16:33:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"49e8746d624a7225f9f90899dd72b70dc7ed594de254bc1515d534f4c903fbba","abstract_canon_sha256":"56b3214850a8f3b72b8c92abd58487861d9d79381dcaf87efb77391a18aae45e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:15:42.891301Z","signature_b64":"SJUvhswcNdcdCaW0d4I/EtrHTAzInYf8RYoNNPHmod1551/jX35thy1rYBteEw5VIVweTm+czEfiMBqEEi7PBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"830ac2d98ae689b5a956524b19b527608fc7556a0182605df640f446c62df7e1","last_reissued_at":"2026-06-05T01:15:42.890883Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:15:42.890883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-End Subgraph Detection with GraphDETR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Dexiong Chen, Karsten Borgwardt, Till Hendrik Schulz","submitted_at":"2026-06-04T16:33:15Z","abstract_excerpt":"Subgraph detection seeks to identify whether and where instances of query patterns occur within a larger graph. This problem is fundamental across scientific domains and is closely related to subgraph isomorphism, which is NP-complete, limiting combinatorial approaches to small patterns or moderately sized graphs. We introduce GraphDETR, a deep learning framework that formulates subgraph detection as a set prediction problem, analogous to DETR in object detection. GraphDETR encodes the target graph with a graph neural network, and employs a fixed set of learnable query vectors, decoded via a t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.06364","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/2606.06364/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":"2606.06364","created_at":"2026-06-05T01:15:42.890943+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.06364v1","created_at":"2026-06-05T01:15:42.890943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.06364","created_at":"2026-06-05T01:15:42.890943+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMFMFWMK42E3","created_at":"2026-06-05T01:15:42.890943+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMFMFWMK42E3LKKW","created_at":"2026-06-05T01:15:42.890943+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMFMFWMK","created_at":"2026-06-05T01:15:42.890943+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/QMFMFWMK42E3LKKWKJFRTNJHMC","json":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC.json","graph_json":"https://pith.science/api/pith-number/QMFMFWMK42E3LKKWKJFRTNJHMC/graph.json","events_json":"https://pith.science/api/pith-number/QMFMFWMK42E3LKKWKJFRTNJHMC/events.json","paper":"https://pith.science/paper/QMFMFWMK"},"agent_actions":{"view_html":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC","download_json":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC.json","view_paper":"https://pith.science/paper/QMFMFWMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.06364&json=true","fetch_graph":"https://pith.science/api/pith-number/QMFMFWMK42E3LKKWKJFRTNJHMC/graph.json","fetch_events":"https://pith.science/api/pith-number/QMFMFWMK42E3LKKWKJFRTNJHMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC/action/storage_attestation","attest_author":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC/action/author_attestation","sign_citation":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC/action/citation_signature","submit_replication":"https://pith.science/pith/QMFMFWMK42E3LKKWKJFRTNJHMC/action/replication_record"}},"created_at":"2026-06-05T01:15:42.890943+00:00","updated_at":"2026-06-05T01:15:42.890943+00:00"}