{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TC6OZ3NAPO2ARZ7HWYKBD5M7EU","short_pith_number":"pith:TC6OZ3NA","canonical_record":{"source":{"id":"2606.31803","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T15:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"29b418af1c97311f00760cdc2a1a9a824cf2c958cdc0a90c0821233a880dc116","abstract_canon_sha256":"7bbe19266c19d7bd271da14b0c2210b0b5a8d2c026b4ed8bb0e2db63f6232a57"},"schema_version":"1.0"},"canonical_sha256":"98bceceda07bb408e7e7b61411f59f25119204af1357c18e6917ee3b5380304b","source":{"kind":"arxiv","id":"2606.31803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31803","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31803v1","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31803","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"TC6OZ3NAPO2A","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"pith_short_16","alias_value":"TC6OZ3NAPO2ARZ7H","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"pith_short_8","alias_value":"TC6OZ3NA","created_at":"2026-07-01T01:18:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TC6OZ3NAPO2ARZ7HWYKBD5M7EU","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31803","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T15:21:13Z","cross_cats_sorted":[],"title_canon_sha256":"29b418af1c97311f00760cdc2a1a9a824cf2c958cdc0a90c0821233a880dc116","abstract_canon_sha256":"7bbe19266c19d7bd271da14b0c2210b0b5a8d2c026b4ed8bb0e2db63f6232a57"},"schema_version":"1.0"},"canonical_sha256":"98bceceda07bb408e7e7b61411f59f25119204af1357c18e6917ee3b5380304b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:15.739481Z","signature_b64":"sWmQKnhmw4hOh0mpUtfb2aXEkCCtvDQvMO3lZGmIHjmOl2xthZ5iImJFaSe/SCsjMJBtNTO3BDrbTUXdtg4WDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98bceceda07bb408e7e7b61411f59f25119204af1357c18e6917ee3b5380304b","last_reissued_at":"2026-07-01T01:18:15.738899Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:15.738899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31803","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yApzOCRQT8GS8aJGfH/fsteGLQTyq9yB8s2nXqN0cj2T4Fl9TWaRtlVjtgjYK6VD8CPq/ixYJygh+gq/kDpDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:27:05.331981Z"},"content_sha256":"0b7928e4a3938eb1c01f7ea797078a90cd2b49bcd14d9337771b423e6069c887","schema_version":"1.0","event_id":"sha256:0b7928e4a3938eb1c01f7ea797078a90cd2b49bcd14d9337771b423e6069c887"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TC6OZ3NAPO2ARZ7HWYKBD5M7EU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mingjun Liu, Radu Curticapean","submitted_at":"2026-06-30T15:21:13Z","abstract_excerpt":"Jerrum and Meeks (TOCT, JCSS 2015) introduced the counting problems $\\text{IndSub}(\\Phi)$ for fixed graph properties $\\Phi$: Given an input graph $G$ and $k\\in\\mathbb N$, count the $k$-vertex subsets $S \\subseteq V(G)$ such that the induced subgraph $G[S]$ satisfies $\\Phi$. For recursively enumerable $\\Phi$, it is known that $\\text{IndSub}(\\Phi)$ is either #W[1]-hard or fixed-parameter tractable. A direct classification depending on $\\Phi$ however still remains open.\n  In particular, the status was open for the property of graphs without nontrivial automorphisms, also mentioned in a very recen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31803","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.31803/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-01T01:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQz/5EU4Qk13pNre5nBoTesYKovpQ9f+HUcIsOkMflEq4I1sFcDvhsL9a8lBya4d6+QYmhsvHo79sOHTfslXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T16:27:05.332394Z"},"content_sha256":"4c12581ebd337f9ce0256d7723543d0a658775051ade054172082b95da2ff9da","schema_version":"1.0","event_id":"sha256:4c12581ebd337f9ce0256d7723543d0a658775051ade054172082b95da2ff9da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/bundle.json","state_url":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-01T16:27:05Z","links":{"resolver":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU","bundle":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/bundle.json","state":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TC6OZ3NAPO2ARZ7HWYKBD5M7EU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7bbe19266c19d7bd271da14b0c2210b0b5a8d2c026b4ed8bb0e2db63f6232a57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T15:21:13Z","title_canon_sha256":"29b418af1c97311f00760cdc2a1a9a824cf2c958cdc0a90c0821233a880dc116"},"schema_version":"1.0","source":{"id":"2606.31803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31803","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31803v1","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31803","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"TC6OZ3NAPO2A","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"pith_short_16","alias_value":"TC6OZ3NAPO2ARZ7H","created_at":"2026-07-01T01:18:15Z"},{"alias_kind":"pith_short_8","alias_value":"TC6OZ3NA","created_at":"2026-07-01T01:18:15Z"}],"graph_snapshots":[{"event_id":"sha256:4c12581ebd337f9ce0256d7723543d0a658775051ade054172082b95da2ff9da","target":"graph","created_at":"2026-07-01T01:18:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.31803/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Jerrum and Meeks (TOCT, JCSS 2015) introduced the counting problems $\\text{IndSub}(\\Phi)$ for fixed graph properties $\\Phi$: Given an input graph $G$ and $k\\in\\mathbb N$, count the $k$-vertex subsets $S \\subseteq V(G)$ such that the induced subgraph $G[S]$ satisfies $\\Phi$. For recursively enumerable $\\Phi$, it is known that $\\text{IndSub}(\\Phi)$ is either #W[1]-hard or fixed-parameter tractable. A direct classification depending on $\\Phi$ however still remains open.\n  In particular, the status was open for the property of graphs without nontrivial automorphisms, also mentioned in a very recen","authors_text":"Mingjun Liu, Radu Curticapean","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T15:21:13Z","title":"Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31803","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0b7928e4a3938eb1c01f7ea797078a90cd2b49bcd14d9337771b423e6069c887","target":"record","created_at":"2026-07-01T01:18:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7bbe19266c19d7bd271da14b0c2210b0b5a8d2c026b4ed8bb0e2db63f6232a57","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-30T15:21:13Z","title_canon_sha256":"29b418af1c97311f00760cdc2a1a9a824cf2c958cdc0a90c0821233a880dc116"},"schema_version":"1.0","source":{"id":"2606.31803","kind":"arxiv","version":1}},"canonical_sha256":"98bceceda07bb408e7e7b61411f59f25119204af1357c18e6917ee3b5380304b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98bceceda07bb408e7e7b61411f59f25119204af1357c18e6917ee3b5380304b","first_computed_at":"2026-07-01T01:18:15.738899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:15.738899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sWmQKnhmw4hOh0mpUtfb2aXEkCCtvDQvMO3lZGmIHjmOl2xthZ5iImJFaSe/SCsjMJBtNTO3BDrbTUXdtg4WDw==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:15.739481Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b7928e4a3938eb1c01f7ea797078a90cd2b49bcd14d9337771b423e6069c887","sha256:4c12581ebd337f9ce0256d7723543d0a658775051ade054172082b95da2ff9da"],"state_sha256":"4010b3c6b102fe68001a52df0de3cd19e597949d5f3f988849cbbbd15fea6c58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ak+ia/wcXVr/duBK7QpuIR55gLIvRsJ98wCMSfr2Io0Q5uHHJ/FZ0CMRdAZTggCzYyKA00L45j0ahrwAXVeADQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T16:27:05.334375Z","bundle_sha256":"f502bf07ecf6e457e3fd8feb82bd849c36b34c118bd51a37bc84e6e9f8752a2d"}}