{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F73ZDDETAWH2IZ744K7VFYWFV3","short_pith_number":"pith:F73ZDDET","schema_version":"1.0","canonical_sha256":"2ff7918c93058fa467fce2bf52e2c5aef5051b5dc61b5811c73fb15139d762cf","source":{"kind":"arxiv","id":"2211.08605","version":2},"attestation_state":"computed","paper":{"title":"A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Daniel Paul-Pena","submitted_at":"2022-11-16T01:29:32Z","abstract_excerpt":"Counting the number of homomorphisms of a pattern graph H in a large input graph G is a fundamental problem in computer science. There are myriad applications of this problem in databases, graph algorithms, and network science. Often, we need more than just the total count. Especially in large network analysis, we wish to compute, for each vertex v of G, the number of H-homomorphisms that v participates in. This problem is referred to as homomorphism orbit counting, as it relates to the orbits of vertices of H under its automorphisms.\n  Given the need for fast algorithms for this problem, we s"},"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":"2211.08605","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-16T01:29:32Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"53262d589e96cd15e47fe8dbb92cf52bc20cd349dca45dcc0a32159408a38cb8","abstract_canon_sha256":"5d5d7aa7b7eff241de43d86902c194008b88aef4bea5da2660c939cb9c529472"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:40.360689Z","signature_b64":"w3gqUF5UTAsyRJFa2HSdJCMmG821bFerwcQT4gXKoRW57ceUJFecIom25tQH1iTH9d/j94tXhPQkmjmqkELfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ff7918c93058fa467fce2bf52e2c5aef5051b5dc61b5811c73fb15139d762cf","last_reissued_at":"2026-07-05T09:10:40.360221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:40.360221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"C. Seshadhri, Daniel Paul-Pena","submitted_at":"2022-11-16T01:29:32Z","abstract_excerpt":"Counting the number of homomorphisms of a pattern graph H in a large input graph G is a fundamental problem in computer science. There are myriad applications of this problem in databases, graph algorithms, and network science. Often, we need more than just the total count. Especially in large network analysis, we wish to compute, for each vertex v of G, the number of H-homomorphisms that v participates in. This problem is referred to as homomorphism orbit counting, as it relates to the orbits of vertices of H under its automorphisms.\n  Given the need for fast algorithms for this problem, we s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.08605","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/2211.08605/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":"2211.08605","created_at":"2026-07-05T09:10:40.360278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.08605v2","created_at":"2026-07-05T09:10:40.360278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.08605","created_at":"2026-07-05T09:10:40.360278+00:00"},{"alias_kind":"pith_short_12","alias_value":"F73ZDDETAWH2","created_at":"2026-07-05T09:10:40.360278+00:00"},{"alias_kind":"pith_short_16","alias_value":"F73ZDDETAWH2IZ74","created_at":"2026-07-05T09:10:40.360278+00:00"},{"alias_kind":"pith_short_8","alias_value":"F73ZDDET","created_at":"2026-07-05T09:10:40.360278+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/F73ZDDETAWH2IZ744K7VFYWFV3","json":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3.json","graph_json":"https://pith.science/api/pith-number/F73ZDDETAWH2IZ744K7VFYWFV3/graph.json","events_json":"https://pith.science/api/pith-number/F73ZDDETAWH2IZ744K7VFYWFV3/events.json","paper":"https://pith.science/paper/F73ZDDET"},"agent_actions":{"view_html":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3","download_json":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3.json","view_paper":"https://pith.science/paper/F73ZDDET","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.08605&json=true","fetch_graph":"https://pith.science/api/pith-number/F73ZDDETAWH2IZ744K7VFYWFV3/graph.json","fetch_events":"https://pith.science/api/pith-number/F73ZDDETAWH2IZ744K7VFYWFV3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3/action/storage_attestation","attest_author":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3/action/author_attestation","sign_citation":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3/action/citation_signature","submit_replication":"https://pith.science/pith/F73ZDDETAWH2IZ744K7VFYWFV3/action/replication_record"}},"created_at":"2026-07-05T09:10:40.360278+00:00","updated_at":"2026-07-05T09:10:40.360278+00:00"}