{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MK6S5A73HPLJXXAJGTQIR2NU4W","short_pith_number":"pith:MK6S5A73","canonical_record":{"source":{"id":"1006.5234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-27T20:29:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f2622f0c426c46d5a4ad7866017ceeb6abdced0d70d6f40fb53627446c20bfa7","abstract_canon_sha256":"5504ce9e7fcf82fc23d49f3f087011d2761ffa1ba2a5b07aef45ff796f366c51"},"schema_version":"1.0"},"canonical_sha256":"62bd2e83fb3bd69bdc0934e088e9b4e5ba36757d87b8f3acb86ac99a80cb08df","source":{"kind":"arxiv","id":"1006.5234","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.5234","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1006.5234v2","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5234","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"MK6S5A73HPLJ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MK6S5A73HPLJXXAJ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MK6S5A73","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MK6S5A73HPLJXXAJGTQIR2NU4W","target":"record","payload":{"canonical_record":{"source":{"id":"1006.5234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-27T20:29:56Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f2622f0c426c46d5a4ad7866017ceeb6abdced0d70d6f40fb53627446c20bfa7","abstract_canon_sha256":"5504ce9e7fcf82fc23d49f3f087011d2761ffa1ba2a5b07aef45ff796f366c51"},"schema_version":"1.0"},"canonical_sha256":"62bd2e83fb3bd69bdc0934e088e9b4e5ba36757d87b8f3acb86ac99a80cb08df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:12.333967Z","signature_b64":"Yy0lLtryKt6dQRf7vva7tx9RDzLD/cFFdW/ARLcUqpZrltTO7Ut8cyg43yMXKMDfTJzwlfTRIyMqn9qBbKocAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62bd2e83fb3bd69bdc0934e088e9b4e5ba36757d87b8f3acb86ac99a80cb08df","last_reissued_at":"2026-05-18T03:17:12.333364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:12.333364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.5234","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-18T03:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysD/K+OgSZ2arnGQonwg68xu7pqH1nmzOypO9uLdf0TDOEZI3TJrsBuyGKBFrBCWrtvSNMBfROTVcEOmzowcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:59:49.897200Z"},"content_sha256":"108f047f17f8476471bd026d67ac0b2aa667c999a051afe6426d062f5bcaafe5","schema_version":"1.0","event_id":"sha256:108f047f17f8476471bd026d67ac0b2aa667c999a051afe6426d062f5bcaafe5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MK6S5A73HPLJXXAJGTQIR2NU4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Leslie Ann Goldberg, Mark Jerrum","submitted_at":"2010-06-27T20:29:56Z","abstract_excerpt":"We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary matroid with parameters q>= 2 and gamma. (Relative to the classical (x,y) parameterisation, q=(x-1)(y-1) and gamma=y-1.) A graph is a special case of a binary matroid, so earlier work by the authors shows inapproximability (subject to certain complexity assumptions) for q>2, apart from the trivial case gamma=0. The situation for q=2 is different. Previous results for graphs imply inapproximability in the region -2<=gamma<0, apart from at t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5234","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-18T03:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlCZ7TT08bpp0yPt1BQcfbb9lqcAOqOaMrPAQMRHQd50oDmO+NNlpDYpymxySezJoNLzrvV8vjglme7p8rVLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T06:59:49.897849Z"},"content_sha256":"c4381ee4e15d5667397176baf7ae2db58a3127bf59472d32f5833a2ea4ef7908","schema_version":"1.0","event_id":"sha256:c4381ee4e15d5667397176baf7ae2db58a3127bf59472d32f5833a2ea4ef7908"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MK6S5A73HPLJXXAJGTQIR2NU4W/bundle.json","state_url":"https://pith.science/pith/MK6S5A73HPLJXXAJGTQIR2NU4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MK6S5A73HPLJXXAJGTQIR2NU4W/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-12T06:59:49Z","links":{"resolver":"https://pith.science/pith/MK6S5A73HPLJXXAJGTQIR2NU4W","bundle":"https://pith.science/pith/MK6S5A73HPLJXXAJGTQIR2NU4W/bundle.json","state":"https://pith.science/pith/MK6S5A73HPLJXXAJGTQIR2NU4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MK6S5A73HPLJXXAJGTQIR2NU4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MK6S5A73HPLJXXAJGTQIR2NU4W","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":"5504ce9e7fcf82fc23d49f3f087011d2761ffa1ba2a5b07aef45ff796f366c51","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-27T20:29:56Z","title_canon_sha256":"f2622f0c426c46d5a4ad7866017ceeb6abdced0d70d6f40fb53627446c20bfa7"},"schema_version":"1.0","source":{"id":"1006.5234","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.5234","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1006.5234v2","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5234","created_at":"2026-05-18T03:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"MK6S5A73HPLJ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MK6S5A73HPLJXXAJ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MK6S5A73","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:c4381ee4e15d5667397176baf7ae2db58a3127bf59472d32f5833a2ea4ef7908","target":"graph","created_at":"2026-05-18T03:17:12Z","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 consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary matroid with parameters q>= 2 and gamma. (Relative to the classical (x,y) parameterisation, q=(x-1)(y-1) and gamma=y-1.) A graph is a special case of a binary matroid, so earlier work by the authors shows inapproximability (subject to certain complexity assumptions) for q>2, apart from the trivial case gamma=0. The situation for q=2 is different. Previous results for graphs imply inapproximability in the region -2<=gamma<0, apart from at t","authors_text":"Leslie Ann Goldberg, Mark Jerrum","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-27T20:29:56Z","title":"Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5234","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:108f047f17f8476471bd026d67ac0b2aa667c999a051afe6426d062f5bcaafe5","target":"record","created_at":"2026-05-18T03:17:12Z","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":"5504ce9e7fcf82fc23d49f3f087011d2761ffa1ba2a5b07aef45ff796f366c51","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-06-27T20:29:56Z","title_canon_sha256":"f2622f0c426c46d5a4ad7866017ceeb6abdced0d70d6f40fb53627446c20bfa7"},"schema_version":"1.0","source":{"id":"1006.5234","kind":"arxiv","version":2}},"canonical_sha256":"62bd2e83fb3bd69bdc0934e088e9b4e5ba36757d87b8f3acb86ac99a80cb08df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62bd2e83fb3bd69bdc0934e088e9b4e5ba36757d87b8f3acb86ac99a80cb08df","first_computed_at":"2026-05-18T03:17:12.333364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:12.333364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yy0lLtryKt6dQRf7vva7tx9RDzLD/cFFdW/ARLcUqpZrltTO7Ut8cyg43yMXKMDfTJzwlfTRIyMqn9qBbKocAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:12.333967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.5234","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:108f047f17f8476471bd026d67ac0b2aa667c999a051afe6426d062f5bcaafe5","sha256:c4381ee4e15d5667397176baf7ae2db58a3127bf59472d32f5833a2ea4ef7908"],"state_sha256":"9d897f6afe1935ccce78cd90f06ac45daee0957435765f9e155d413658a52904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vAjqqkCWINGeeBvnE/fvIJ6apvJXTDrjdqR13Ssutfhipko5Fo4lDy/+4UXc59/f3YCLolIMJLs+s8spv6r0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T06:59:49.900991Z","bundle_sha256":"6e185b78149444ef20887093c4eba47608bf3416c1fcd967ae8f8b2c499ee712"}}