{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YIWGOTLQNXX4ETEGWUUQOQJLVT","short_pith_number":"pith:YIWGOTLQ","canonical_record":{"source":{"id":"2103.05588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-09T17:52:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c2088b5e1a4dc02b50666f414553465adaab865462dd4e7a87caa913b5bfd438","abstract_canon_sha256":"ff33898bf88ae48cd187a8ec30feb4a246422836b791a3fd155c98b933b2ecd7"},"schema_version":"1.0"},"canonical_sha256":"c22c674d706defc24c86b52907412bacde125f4cca2e3abf2eb38ee15b94f9d8","source":{"kind":"arxiv","id":"2103.05588","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.05588","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"2103.05588v2","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.05588","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"YIWGOTLQNXX4","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"pith_short_16","alias_value":"YIWGOTLQNXX4ETEG","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"pith_short_8","alias_value":"YIWGOTLQ","created_at":"2026-07-05T02:44:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YIWGOTLQNXX4ETEGWUUQOQJLVT","target":"record","payload":{"canonical_record":{"source":{"id":"2103.05588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-09T17:52:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c2088b5e1a4dc02b50666f414553465adaab865462dd4e7a87caa913b5bfd438","abstract_canon_sha256":"ff33898bf88ae48cd187a8ec30feb4a246422836b791a3fd155c98b933b2ecd7"},"schema_version":"1.0"},"canonical_sha256":"c22c674d706defc24c86b52907412bacde125f4cca2e3abf2eb38ee15b94f9d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:44:55.795250Z","signature_b64":"OgsyWKBQeRJRyjmRB9LCz9FtuqpLfIlGE9H0jsPYmG2YKmolMNle296tLesGa+DhCHGng70Vqze6q7rT16zyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c22c674d706defc24c86b52907412bacde125f4cca2e3abf2eb38ee15b94f9d8","last_reissued_at":"2026-07-05T02:44:55.794786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:44:55.794786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.05588","source_version":2,"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-05T02:44:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnUu/XwGkh6jfnn+ohhSmKWPqZKDSC2ePKHUmbf1Zg0t7H+90lzKlq4ei0MMBAGJGdloGntmnjluBHiWRYdoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:24:35.777262Z"},"content_sha256":"e76d03c9f038c96c5913b90e02203e4cbb9e03d6a412c83e0ff42051a2629988","schema_version":"1.0","event_id":"sha256:e76d03c9f038c96c5913b90e02203e4cbb9e03d6a412c83e0ff42051a2629988"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YIWGOTLQNXX4ETEGWUUQOQJLVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Marco Bressan, Marc Roth","submitted_at":"2021-03-09T17:52:27Z","abstract_excerpt":"We study the problems of counting the homomorphisms, counting the copies, and counting the induced copies of a $k$-vertex graph $H$ in a $d$-degenerate $n$-vertex graph $G$. Our main result establishes exhaustive and explicit complexity classifications for counting subgraphs and induced subgraphs. We show that the (not necessarily induced) copies of $H$ in $G$ can be counted in time $f(k,d)\\cdot n^{\\max(\\mathsf{imn}(H),1)}\\cdot \\log n$, where $f$ is some computable function and $\\mathsf{imn}(H)$ is the size of the largest induced matching of $H$. Whenever the class of allowed patterns has unbo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.05588","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/2103.05588/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-05T02:44:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bElqlIgVb/l7AyXWiXUHcNqQEfUUSrL9Dt2or7xLlr+QOKXOdYykFhuHMxf6QEcD+S04FKY6ykBtMYXlC4oMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T22:24:35.777791Z"},"content_sha256":"0fbd8dbe671ff4bbe8585b4111e8e890d0dc081a94ce6662ae846af9bd0e8647","schema_version":"1.0","event_id":"sha256:0fbd8dbe671ff4bbe8585b4111e8e890d0dc081a94ce6662ae846af9bd0e8647"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT/bundle.json","state_url":"https://pith.science/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT/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-08-23T22:24:35Z","links":{"resolver":"https://pith.science/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT","bundle":"https://pith.science/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT/bundle.json","state":"https://pith.science/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIWGOTLQNXX4ETEGWUUQOQJLVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YIWGOTLQNXX4ETEGWUUQOQJLVT","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":"ff33898bf88ae48cd187a8ec30feb4a246422836b791a3fd155c98b933b2ecd7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-09T17:52:27Z","title_canon_sha256":"c2088b5e1a4dc02b50666f414553465adaab865462dd4e7a87caa913b5bfd438"},"schema_version":"1.0","source":{"id":"2103.05588","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.05588","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"arxiv_version","alias_value":"2103.05588v2","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.05588","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"pith_short_12","alias_value":"YIWGOTLQNXX4","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"pith_short_16","alias_value":"YIWGOTLQNXX4ETEG","created_at":"2026-07-05T02:44:55Z"},{"alias_kind":"pith_short_8","alias_value":"YIWGOTLQ","created_at":"2026-07-05T02:44:55Z"}],"graph_snapshots":[{"event_id":"sha256:0fbd8dbe671ff4bbe8585b4111e8e890d0dc081a94ce6662ae846af9bd0e8647","target":"graph","created_at":"2026-07-05T02:44:55Z","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/2103.05588/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problems of counting the homomorphisms, counting the copies, and counting the induced copies of a $k$-vertex graph $H$ in a $d$-degenerate $n$-vertex graph $G$. Our main result establishes exhaustive and explicit complexity classifications for counting subgraphs and induced subgraphs. We show that the (not necessarily induced) copies of $H$ in $G$ can be counted in time $f(k,d)\\cdot n^{\\max(\\mathsf{imn}(H),1)}\\cdot \\log n$, where $f$ is some computable function and $\\mathsf{imn}(H)$ is the size of the largest induced matching of $H$. Whenever the class of allowed patterns has unbo","authors_text":"Marco Bressan, Marc Roth","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-09T17:52:27Z","title":"Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.05588","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:e76d03c9f038c96c5913b90e02203e4cbb9e03d6a412c83e0ff42051a2629988","target":"record","created_at":"2026-07-05T02:44:55Z","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":"ff33898bf88ae48cd187a8ec30feb4a246422836b791a3fd155c98b933b2ecd7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-03-09T17:52:27Z","title_canon_sha256":"c2088b5e1a4dc02b50666f414553465adaab865462dd4e7a87caa913b5bfd438"},"schema_version":"1.0","source":{"id":"2103.05588","kind":"arxiv","version":2}},"canonical_sha256":"c22c674d706defc24c86b52907412bacde125f4cca2e3abf2eb38ee15b94f9d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c22c674d706defc24c86b52907412bacde125f4cca2e3abf2eb38ee15b94f9d8","first_computed_at":"2026-07-05T02:44:55.794786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:44:55.794786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OgsyWKBQeRJRyjmRB9LCz9FtuqpLfIlGE9H0jsPYmG2YKmolMNle296tLesGa+DhCHGng70Vqze6q7rT16zyBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:44:55.795250Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.05588","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e76d03c9f038c96c5913b90e02203e4cbb9e03d6a412c83e0ff42051a2629988","sha256:0fbd8dbe671ff4bbe8585b4111e8e890d0dc081a94ce6662ae846af9bd0e8647"],"state_sha256":"cae46ba95787898e59bd0d03528e6e5241101816080c6d6dcf39f915526b2600"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5oosfRiVfFEfmSBdUNrr5whETFhLhGauAuxcmB32uxzaeLXP0q9mOkQWtmIvIzxs8vGVTwHpLpj5FAT2/aiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T22:24:35.782246Z","bundle_sha256":"14a4cf187cedb7b99aa79e4298620288bab4a816bfba9310202f07569f1d888e"}}