{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TC6OZ3NAPO2ARZ7HWYKBD5M7EU","short_pith_number":"pith:TC6OZ3NA","schema_version":"1.0","canonical_sha256":"98bceceda07bb408e7e7b61411f59f25119204af1357c18e6917ee3b5380304b","source":{"kind":"arxiv","id":"2606.31803","version":1},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.31803","created_at":"2026-07-01T01:18:15.738979+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31803v1","created_at":"2026-07-01T01:18:15.738979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31803","created_at":"2026-07-01T01:18:15.738979+00:00"},{"alias_kind":"pith_short_12","alias_value":"TC6OZ3NAPO2A","created_at":"2026-07-01T01:18:15.738979+00:00"},{"alias_kind":"pith_short_16","alias_value":"TC6OZ3NAPO2ARZ7H","created_at":"2026-07-01T01:18:15.738979+00:00"},{"alias_kind":"pith_short_8","alias_value":"TC6OZ3NA","created_at":"2026-07-01T01:18:15.738979+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/TC6OZ3NAPO2ARZ7HWYKBD5M7EU","json":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU.json","graph_json":"https://pith.science/api/pith-number/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/graph.json","events_json":"https://pith.science/api/pith-number/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/events.json","paper":"https://pith.science/paper/TC6OZ3NA"},"agent_actions":{"view_html":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU","download_json":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU.json","view_paper":"https://pith.science/paper/TC6OZ3NA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31803&json=true","fetch_graph":"https://pith.science/api/pith-number/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/graph.json","fetch_events":"https://pith.science/api/pith-number/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/action/storage_attestation","attest_author":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/action/author_attestation","sign_citation":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/action/citation_signature","submit_replication":"https://pith.science/pith/TC6OZ3NAPO2ARZ7HWYKBD5M7EU/action/replication_record"}},"created_at":"2026-07-01T01:18:15.738979+00:00","updated_at":"2026-07-01T01:18:15.738979+00:00"}