{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3X77RMDTRIMUHYOLKKNCIZXOVC","short_pith_number":"pith:3X77RMDT","schema_version":"1.0","canonical_sha256":"ddfff8b0738a1943e1cb529a2466eea8bb9c355226556b882d2b981f71c61976","source":{"kind":"arxiv","id":"2606.24421","version":1},"attestation_state":"computed","paper":{"title":"Can Aggregate Invariants Accelerate Continuous Subgraph Matching? Limits, Laws, and a Dynamic Spectral Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.AI","authors_text":"Jiale Zheng, Minghao Chen","submitted_at":"2026-06-23T10:58:44Z","abstract_excerpt":"Spectral filtering recently delivered substantial pruning for \\emph{static} subgraph matching: Laplacian interlacing rejects candidates whose neighborhoods cannot host the query. We study whether such aggregate structural tests can accelerate \\emph{continuous} subgraph matching (CSM) over dynamic graphs, and answer in three parts. First, lazily maintained spectral bounds are infeasible exactly where spectral pruning has value: we characterize the tightest safe rule over a formalized perturbation relaxation and show that even it loses essentially all pruning power within four touching updates. "},"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.24421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-06-23T10:58:44Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"a689a2354dc79ef77a7fdaa5a5ebd4fe59480bad774ac37009090a0f0966c5ba","abstract_canon_sha256":"79b47c2640036c959e736ac133c6e96094ba3e76cf7d7ca325549a6885b2b026"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:29.982748Z","signature_b64":"MrgNh8gE8DO4BFXykP3pDAcyq6OMYdYh2jKDW3Ugrip+4Ve0rIOz4GzZhuG4UnB4b4k2cQq5l/Wh8EBMS4kHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddfff8b0738a1943e1cb529a2466eea8bb9c355226556b882d2b981f71c61976","last_reissued_at":"2026-06-24T01:15:29.982401Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:29.982401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Aggregate Invariants Accelerate Continuous Subgraph Matching? Limits, Laws, and a Dynamic Spectral Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.AI","authors_text":"Jiale Zheng, Minghao Chen","submitted_at":"2026-06-23T10:58:44Z","abstract_excerpt":"Spectral filtering recently delivered substantial pruning for \\emph{static} subgraph matching: Laplacian interlacing rejects candidates whose neighborhoods cannot host the query. We study whether such aggregate structural tests can accelerate \\emph{continuous} subgraph matching (CSM) over dynamic graphs, and answer in three parts. First, lazily maintained spectral bounds are infeasible exactly where spectral pruning has value: we characterize the tightest safe rule over a formalized perturbation relaxation and show that even it loses essentially all pruning power within four touching updates. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24421","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.24421/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.24421","created_at":"2026-06-24T01:15:29.982463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24421v1","created_at":"2026-06-24T01:15:29.982463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24421","created_at":"2026-06-24T01:15:29.982463+00:00"},{"alias_kind":"pith_short_12","alias_value":"3X77RMDTRIMU","created_at":"2026-06-24T01:15:29.982463+00:00"},{"alias_kind":"pith_short_16","alias_value":"3X77RMDTRIMUHYOL","created_at":"2026-06-24T01:15:29.982463+00:00"},{"alias_kind":"pith_short_8","alias_value":"3X77RMDT","created_at":"2026-06-24T01:15:29.982463+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/3X77RMDTRIMUHYOLKKNCIZXOVC","json":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC.json","graph_json":"https://pith.science/api/pith-number/3X77RMDTRIMUHYOLKKNCIZXOVC/graph.json","events_json":"https://pith.science/api/pith-number/3X77RMDTRIMUHYOLKKNCIZXOVC/events.json","paper":"https://pith.science/paper/3X77RMDT"},"agent_actions":{"view_html":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC","download_json":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC.json","view_paper":"https://pith.science/paper/3X77RMDT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24421&json=true","fetch_graph":"https://pith.science/api/pith-number/3X77RMDTRIMUHYOLKKNCIZXOVC/graph.json","fetch_events":"https://pith.science/api/pith-number/3X77RMDTRIMUHYOLKKNCIZXOVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC/action/storage_attestation","attest_author":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC/action/author_attestation","sign_citation":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC/action/citation_signature","submit_replication":"https://pith.science/pith/3X77RMDTRIMUHYOLKKNCIZXOVC/action/replication_record"}},"created_at":"2026-06-24T01:15:29.982463+00:00","updated_at":"2026-06-24T01:15:29.982463+00:00"}