{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:ZDDUFOGC56VZBIOQ2AACSYTN2Z","short_pith_number":"pith:ZDDUFOGC","canonical_record":{"source":{"id":"0806.2287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-13T17:06:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cd29edc76715972b3ad3e7881aa34e8343e66d44716975d7f48d7f637d6da8db","abstract_canon_sha256":"c1e010903b9c6f2903ecb9b4bd857e204ff905bbbc870f9da4e68b4a1748b05e"},"schema_version":"1.0"},"canonical_sha256":"c8c742b8c2efab90a1d0d00029626dd64c01ddd9f31d4673ceea7df0fcd753e5","source":{"kind":"arxiv","id":"0806.2287","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.2287","created_at":"2026-05-17T23:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"0806.2287v2","created_at":"2026-05-17T23:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2287","created_at":"2026-05-17T23:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZDDUFOGC56VZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZDDUFOGC56VZBIOQ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZDDUFOGC","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:ZDDUFOGC56VZBIOQ2AACSYTN2Z","target":"record","payload":{"canonical_record":{"source":{"id":"0806.2287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-13T17:06:01Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cd29edc76715972b3ad3e7881aa34e8343e66d44716975d7f48d7f637d6da8db","abstract_canon_sha256":"c1e010903b9c6f2903ecb9b4bd857e204ff905bbbc870f9da4e68b4a1748b05e"},"schema_version":"1.0"},"canonical_sha256":"c8c742b8c2efab90a1d0d00029626dd64c01ddd9f31d4673ceea7df0fcd753e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:20.179486Z","signature_b64":"YAgZDsiH04XtOyc44QpqEteLNriSn1hSehAKrlrVSLiBjktZtO0A9WWmC/y7h1gkDIWBrs7azno2Jpy/wZeEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8c742b8c2efab90a1d0d00029626dd64c01ddd9f31d4673ceea7df0fcd753e5","last_reissued_at":"2026-05-17T23:53:20.178765Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:20.178765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.2287","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-17T23:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TsnKaz2WNm+XgSI4slWuG9urV1ohUJtSux/jjgd5dRK5NWaVcxY9AHJh4UHYbZRXDlo63dNRQVk3ZhmDI4v7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:53:47.191014Z"},"content_sha256":"fc7d09cde15ed53d424b5f31e5dc9a2d2bf94a503f80a99e2449c84f3a14eeba","schema_version":"1.0","event_id":"sha256:fc7d09cde15ed53d424b5f31e5dc9a2d2bf94a503f80a99e2449c84f3a14eeba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:ZDDUFOGC56VZBIOQ2AACSYTN2Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximately Counting Embeddings into Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Martin Furer, Shiva Prasad Kasiviswanathan","submitted_at":"2008-06-13T17:06:01Z","abstract_excerpt":"Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (monomer-dimer problem). In this paper, we present the first general subcase of the subgraph isomorphism counting problem which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labeling of the vertices such that eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2287","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-17T23:53:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euVeos2aohjIk8luP9iIlK8yO4YY1f0IsSMJIhXzBqvn5EGinWAfwQaBIHltNeQAFA39/O6Ga/xjQWA4If65BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:53:47.191378Z"},"content_sha256":"69c21623c3536564494e3ff574c6d2b41744999bb492c7f130a5765fa577f839","schema_version":"1.0","event_id":"sha256:69c21623c3536564494e3ff574c6d2b41744999bb492c7f130a5765fa577f839"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z/bundle.json","state_url":"https://pith.science/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z/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-02T07:53:47Z","links":{"resolver":"https://pith.science/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z","bundle":"https://pith.science/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z/bundle.json","state":"https://pith.science/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZDDUFOGC56VZBIOQ2AACSYTN2Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:ZDDUFOGC56VZBIOQ2AACSYTN2Z","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":"c1e010903b9c6f2903ecb9b4bd857e204ff905bbbc870f9da4e68b4a1748b05e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-13T17:06:01Z","title_canon_sha256":"cd29edc76715972b3ad3e7881aa34e8343e66d44716975d7f48d7f637d6da8db"},"schema_version":"1.0","source":{"id":"0806.2287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.2287","created_at":"2026-05-17T23:53:20Z"},{"alias_kind":"arxiv_version","alias_value":"0806.2287v2","created_at":"2026-05-17T23:53:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.2287","created_at":"2026-05-17T23:53:20Z"},{"alias_kind":"pith_short_12","alias_value":"ZDDUFOGC56VZ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ZDDUFOGC56VZBIOQ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ZDDUFOGC","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:69c21623c3536564494e3ff574c6d2b41744999bb492c7f130a5765fa577f839","target":"graph","created_at":"2026-05-17T23:53:20Z","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":"Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (monomer-dimer problem). In this paper, we present the first general subcase of the subgraph isomorphism counting problem which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labeling of the vertices such that eve","authors_text":"Martin Furer, Shiva Prasad Kasiviswanathan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-13T17:06:01Z","title":"Approximately Counting Embeddings into Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.2287","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:fc7d09cde15ed53d424b5f31e5dc9a2d2bf94a503f80a99e2449c84f3a14eeba","target":"record","created_at":"2026-05-17T23:53:20Z","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":"c1e010903b9c6f2903ecb9b4bd857e204ff905bbbc870f9da4e68b4a1748b05e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-06-13T17:06:01Z","title_canon_sha256":"cd29edc76715972b3ad3e7881aa34e8343e66d44716975d7f48d7f637d6da8db"},"schema_version":"1.0","source":{"id":"0806.2287","kind":"arxiv","version":2}},"canonical_sha256":"c8c742b8c2efab90a1d0d00029626dd64c01ddd9f31d4673ceea7df0fcd753e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8c742b8c2efab90a1d0d00029626dd64c01ddd9f31d4673ceea7df0fcd753e5","first_computed_at":"2026-05-17T23:53:20.178765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:20.178765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YAgZDsiH04XtOyc44QpqEteLNriSn1hSehAKrlrVSLiBjktZtO0A9WWmC/y7h1gkDIWBrs7azno2Jpy/wZeEBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:20.179486Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.2287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7d09cde15ed53d424b5f31e5dc9a2d2bf94a503f80a99e2449c84f3a14eeba","sha256:69c21623c3536564494e3ff574c6d2b41744999bb492c7f130a5765fa577f839"],"state_sha256":"ac835a792bc1b0f7b7613ea824fbb62a81e86a61a4c6c101bbdf66fdb91e661b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yifAheaSxms5MZm2P6DFK/STzvjZnte87Jp2fn3SiyX48OynzjY+L36oGsGWC7lrCCiS4IMqqlwxrbTprxXIDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:53:47.193265Z","bundle_sha256":"47535213c0c96a44a62bb02fccbb62e9e71a4284e1c5b59bea96ed6cfe03b48f"}}