{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EMLMZG3XOZ7Z6ZTDXHE44GNNVN","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":"9106b8de49b9f69481d772a87bb1a04aef14da2ea7771a25abd8720e9d93f246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-14T02:15:15Z","title_canon_sha256":"946a529e75603b337f7d71b20402fde363362036b3ceee808357390f54aa53f2"},"schema_version":"1.0","source":{"id":"1911.05896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05896","created_at":"2026-07-05T00:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05896v2","created_at":"2026-07-05T00:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05896","created_at":"2026-07-05T00:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"EMLMZG3XOZ7Z","created_at":"2026-07-05T00:22:43Z"},{"alias_kind":"pith_short_16","alias_value":"EMLMZG3XOZ7Z6ZTD","created_at":"2026-07-05T00:22:43Z"},{"alias_kind":"pith_short_8","alias_value":"EMLMZG3X","created_at":"2026-07-05T00:22:43Z"}],"graph_snapshots":[{"event_id":"sha256:c65ca2b3d09ef8ee4c5fa514e489a84acc93e022a50140831ce3cdfd36c021f8","target":"graph","created_at":"2026-07-05T00:22:43Z","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/1911.05896/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of counting all $k$-vertex subgraphs in an input graph, for any constant $k$. This problem (denoted sub-cnt$_k$) has been studied extensively in both theory and practice. In a classic result, Chiba and Nishizeki (SICOMP 85) gave linear time algorithms for clique and 4-cycle counting for bounded degeneracy graphs. This is a rich class of sparse graphs that contains, for example, all minor-free families and preferential attachment graphs. The techniques from this result have inspired a number of recent practical algorithms for sub-cnt$_k$. Towards a better understanding o","authors_text":"C. Seshadhri, Noujan Pashanasangi, Suman K. Bera","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-14T02:15:15Z","title":"Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05896","kind":"arxiv","version":2},"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:718f42f78e111f91bb23089581773666e300d0d655223b1aff3cc5460b7e6ead","target":"record","created_at":"2026-07-05T00:22:43Z","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":"9106b8de49b9f69481d772a87bb1a04aef14da2ea7771a25abd8720e9d93f246","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-14T02:15:15Z","title_canon_sha256":"946a529e75603b337f7d71b20402fde363362036b3ceee808357390f54aa53f2"},"schema_version":"1.0","source":{"id":"1911.05896","kind":"arxiv","version":2}},"canonical_sha256":"2316cc9b77767f9f6663b9c9ce19adab44a8243070e489bb732df8d180f8d934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2316cc9b77767f9f6663b9c9ce19adab44a8243070e489bb732df8d180f8d934","first_computed_at":"2026-07-05T00:22:43.056632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:22:43.056632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1xVmMOnce8qE6XzLYioNtW/8FmHNI5BlAFzmOTiEey7ByI7Mz+8eXR2rgKIJW7ZbIC3gf9bgxDqjYvlJPCxBCw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:22:43.057074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.05896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:718f42f78e111f91bb23089581773666e300d0d655223b1aff3cc5460b7e6ead","sha256:c65ca2b3d09ef8ee4c5fa514e489a84acc93e022a50140831ce3cdfd36c021f8"],"state_sha256":"f0c704b7f35910d0c28ed5ca4d0521fd1a812cc5bda7a759812ad2d0e83ebca5"}