{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CXK2DVIFCRILNSSCZCQZDGAWMU","short_pith_number":"pith:CXK2DVIF","canonical_record":{"source":{"id":"1305.6306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-27T19:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"7c12037f04345fd3412dc1c02cea48fd37b8e6d3cec2310c3ed3b1b1893d3d3e","abstract_canon_sha256":"d70f4e194df366bf83923c88366e4659e854671876ad1df496dc91898be52b17"},"schema_version":"1.0"},"canonical_sha256":"15d5a1d5051450b6ca42c8a19198166507e289079d3b934161c155b0e5fa1d31","source":{"kind":"arxiv","id":"1305.6306","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6306","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6306v2","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6306","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"CXK2DVIFCRIL","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CXK2DVIFCRILNSSC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CXK2DVIF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CXK2DVIFCRILNSSCZCQZDGAWMU","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-27T19:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"7c12037f04345fd3412dc1c02cea48fd37b8e6d3cec2310c3ed3b1b1893d3d3e","abstract_canon_sha256":"d70f4e194df366bf83923c88366e4659e854671876ad1df496dc91898be52b17"},"schema_version":"1.0"},"canonical_sha256":"15d5a1d5051450b6ca42c8a19198166507e289079d3b934161c155b0e5fa1d31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:47.185170Z","signature_b64":"nyhBSCnqun4ZJfL+296hdJ+sTP13YsCKQcQgRWlX41L87xlGr+ON4komZ+ypGD765PT9f5TMJWyGwoV63zNKAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15d5a1d5051450b6ca42c8a19198166507e289079d3b934161c155b0e5fa1d31","last_reissued_at":"2026-05-18T02:49:47.184785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:47.184785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6306","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-05-18T02:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mSMpPOZzEd0yfermv0LqjJA8vZr8WNMguUtlzgG8XVx7v2T3ixmri21Iz/UAzQeVEBCG0FwW5IXtYjzMSedDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:44:27.887543Z"},"content_sha256":"62ab3b6a530faee88e33ab416507a4173bde7d24cd32f29a412c991e8acfe36d","schema_version":"1.0","event_id":"sha256:62ab3b6a530faee88e33ab416507a4173bde7d24cd32f29a412c991e8acfe36d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CXK2DVIFCRILNSSCZCQZDGAWMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Approximately Counting Tree Homomorphisms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2013-05-27T19:49:05Z","abstract_excerpt":"We study two computational problems, parameterised by a fixed tree H. #HomsTo(H) is the problem of counting homomorphisms from an input graph G to H. #WHomsTo(H) is the problem of counting weighted homomorphisms to H, given an input graph G and a weight function for each vertex v of G. Even though H is a tree, these problems turn out to be sufficiently rich to capture all of the known approximation behaviour in #P. We give a complete trichotomy for #WHomsTo(H). If H is a star then #WHomsTo(H) is in FP. If H is not a star but it does not contain a certain induced subgraph J_3 then #WHomsTo(H) i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6306","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":""},"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-05-18T02:49:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"owUEx4//gH2s4eBRyuysIoKLZ+1cc268UELobta0TPI0IJm7Zt6PGRV8XWiL9mSGBJQDP9lkeUYJdS8me/x/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:44:27.887903Z"},"content_sha256":"e54cc2b48747c19aa1c80e28ebd30805e1e7b0b045be282354cb28ad7e268f89","schema_version":"1.0","event_id":"sha256:e54cc2b48747c19aa1c80e28ebd30805e1e7b0b045be282354cb28ad7e268f89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXK2DVIFCRILNSSCZCQZDGAWMU/bundle.json","state_url":"https://pith.science/pith/CXK2DVIFCRILNSSCZCQZDGAWMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXK2DVIFCRILNSSCZCQZDGAWMU/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-06-12T10:44:27Z","links":{"resolver":"https://pith.science/pith/CXK2DVIFCRILNSSCZCQZDGAWMU","bundle":"https://pith.science/pith/CXK2DVIFCRILNSSCZCQZDGAWMU/bundle.json","state":"https://pith.science/pith/CXK2DVIFCRILNSSCZCQZDGAWMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXK2DVIFCRILNSSCZCQZDGAWMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CXK2DVIFCRILNSSCZCQZDGAWMU","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":"d70f4e194df366bf83923c88366e4659e854671876ad1df496dc91898be52b17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-27T19:49:05Z","title_canon_sha256":"7c12037f04345fd3412dc1c02cea48fd37b8e6d3cec2310c3ed3b1b1893d3d3e"},"schema_version":"1.0","source":{"id":"1305.6306","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6306","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6306v2","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6306","created_at":"2026-05-18T02:49:47Z"},{"alias_kind":"pith_short_12","alias_value":"CXK2DVIFCRIL","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CXK2DVIFCRILNSSC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CXK2DVIF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e54cc2b48747c19aa1c80e28ebd30805e1e7b0b045be282354cb28ad7e268f89","target":"graph","created_at":"2026-05-18T02:49:47Z","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"},"paper":{"abstract_excerpt":"We study two computational problems, parameterised by a fixed tree H. #HomsTo(H) is the problem of counting homomorphisms from an input graph G to H. #WHomsTo(H) is the problem of counting weighted homomorphisms to H, given an input graph G and a weight function for each vertex v of G. Even though H is a tree, these problems turn out to be sufficiently rich to capture all of the known approximation behaviour in #P. We give a complete trichotomy for #WHomsTo(H). If H is a star then #WHomsTo(H) is in FP. If H is not a star but it does not contain a certain induced subgraph J_3 then #WHomsTo(H) i","authors_text":"Leslie Ann Goldberg, Mark Jerrum","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-27T19:49:05Z","title":"The Complexity of Approximately Counting Tree Homomorphisms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6306","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:62ab3b6a530faee88e33ab416507a4173bde7d24cd32f29a412c991e8acfe36d","target":"record","created_at":"2026-05-18T02:49:47Z","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":"d70f4e194df366bf83923c88366e4659e854671876ad1df496dc91898be52b17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-27T19:49:05Z","title_canon_sha256":"7c12037f04345fd3412dc1c02cea48fd37b8e6d3cec2310c3ed3b1b1893d3d3e"},"schema_version":"1.0","source":{"id":"1305.6306","kind":"arxiv","version":2}},"canonical_sha256":"15d5a1d5051450b6ca42c8a19198166507e289079d3b934161c155b0e5fa1d31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15d5a1d5051450b6ca42c8a19198166507e289079d3b934161c155b0e5fa1d31","first_computed_at":"2026-05-18T02:49:47.184785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:47.184785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nyhBSCnqun4ZJfL+296hdJ+sTP13YsCKQcQgRWlX41L87xlGr+ON4komZ+ypGD765PT9f5TMJWyGwoV63zNKAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:47.185170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6306","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62ab3b6a530faee88e33ab416507a4173bde7d24cd32f29a412c991e8acfe36d","sha256:e54cc2b48747c19aa1c80e28ebd30805e1e7b0b045be282354cb28ad7e268f89"],"state_sha256":"e3c7bbda863347b5e250862ba570109e594473851db441f442c6f2edfd6d707e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"APZ4WMt8K6GJPH/24U0KG1kWR1XTi/Zu5R+cNZG08qpTXjO+YqbvZLltxXJ3WKuCmW5bGg+d9JJskyc4OQH+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:44:27.890349Z","bundle_sha256":"21a807066d33906eff69d5a04e83f602577752dbc4b2cd38ad7f965f77927e93"}}