{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EMLMZG3XOZ7Z6ZTDXHE44GNNVN","short_pith_number":"pith:EMLMZG3X","schema_version":"1.0","canonical_sha256":"2316cc9b77767f9f6663b9c9ce19adab44a8243070e489bb732df8d180f8d934","source":{"kind":"arxiv","id":"1911.05896","version":2},"attestation_state":"computed","paper":{"title":"Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Noujan Pashanasangi, Suman K. Bera","submitted_at":"2019-11-14T02:15:15Z","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"},"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":"1911.05896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-11-14T02:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"946a529e75603b337f7d71b20402fde363362036b3ceee808357390f54aa53f2","abstract_canon_sha256":"9106b8de49b9f69481d772a87bb1a04aef14da2ea7771a25abd8720e9d93f246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:22:43.057074Z","signature_b64":"1xVmMOnce8qE6XzLYioNtW/8FmHNI5BlAFzmOTiEey7ByI7Mz+8eXR2rgKIJW7ZbIC3gf9bgxDqjYvlJPCxBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2316cc9b77767f9f6663b9c9ce19adab44a8243070e489bb732df8d180f8d934","last_reissued_at":"2026-07-05T00:22:43.056632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:22:43.056632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Noujan Pashanasangi, Suman K. Bera","submitted_at":"2019-11-14T02:15:15Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05896","kind":"arxiv","version":2},"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/1911.05896/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":"1911.05896","created_at":"2026-07-05T00:22:43.056691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.05896v2","created_at":"2026-07-05T00:22:43.056691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05896","created_at":"2026-07-05T00:22:43.056691+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMLMZG3XOZ7Z","created_at":"2026-07-05T00:22:43.056691+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMLMZG3XOZ7Z6ZTD","created_at":"2026-07-05T00:22:43.056691+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMLMZG3X","created_at":"2026-07-05T00:22:43.056691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.02136","citing_title":"Locally computing edge orientations","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN","json":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN.json","graph_json":"https://pith.science/api/pith-number/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/graph.json","events_json":"https://pith.science/api/pith-number/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/events.json","paper":"https://pith.science/paper/EMLMZG3X"},"agent_actions":{"view_html":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN","download_json":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN.json","view_paper":"https://pith.science/paper/EMLMZG3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.05896&json=true","fetch_graph":"https://pith.science/api/pith-number/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/graph.json","fetch_events":"https://pith.science/api/pith-number/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/action/storage_attestation","attest_author":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/action/author_attestation","sign_citation":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/action/citation_signature","submit_replication":"https://pith.science/pith/EMLMZG3XOZ7Z6ZTDXHE44GNNVN/action/replication_record"}},"created_at":"2026-07-05T00:22:43.056691+00:00","updated_at":"2026-07-05T00:22:43.056691+00:00"}