{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EFBMTZ7E2D33CP7JG6ZZRY6RUG","short_pith_number":"pith:EFBMTZ7E","canonical_record":{"source":{"id":"1405.1974","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-08T15:36:39Z","cross_cats_sorted":["math-ph","math.MP","math.OC"],"title_canon_sha256":"011aa7147ee61800a2fc5d99a5636804e4adc86b7a8d4bab38945a7397d4d73f","abstract_canon_sha256":"337b8f01f5591d276ba3cfb8f0c5fdfea751976bbb2af4c4eb8427029d9da668"},"schema_version":"1.0"},"canonical_sha256":"2142c9e7e4d0f7b13fe937b398e3d1a1b9b41edcc62fd61c359c12aa556c706c","source":{"kind":"arxiv","id":"1405.1974","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1974","created_at":"2026-05-18T02:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1974v3","created_at":"2026-05-18T02:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1974","created_at":"2026-05-18T02:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"EFBMTZ7E2D33","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EFBMTZ7E2D33CP7J","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EFBMTZ7E","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EFBMTZ7E2D33CP7JG6ZZRY6RUG","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1974","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-08T15:36:39Z","cross_cats_sorted":["math-ph","math.MP","math.OC"],"title_canon_sha256":"011aa7147ee61800a2fc5d99a5636804e4adc86b7a8d4bab38945a7397d4d73f","abstract_canon_sha256":"337b8f01f5591d276ba3cfb8f0c5fdfea751976bbb2af4c4eb8427029d9da668"},"schema_version":"1.0"},"canonical_sha256":"2142c9e7e4d0f7b13fe937b398e3d1a1b9b41edcc62fd61c359c12aa556c706c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:10.509936Z","signature_b64":"SK2WEEHCICL5dINCyfJgrl9E4WeIMllEmcIVR2GyOf5LR7wGgV2smM+E5ak19cKxFMDTtJn23Rk2oOntQtzTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2142c9e7e4d0f7b13fe937b398e3d1a1b9b41edcc62fd61c359c12aa556c706c","last_reissued_at":"2026-05-18T02:40:10.509433Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:10.509433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1974","source_version":3,"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:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXKrfmVY4gJKRgCKhGI/RRTy5GgqJSWdCDE0KB+R7ws1rYH0y6SFTN6YBl68BZJT9NcbR2LUPnBFvBMshYIaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:15:23.663795Z"},"content_sha256":"3b0ffccd1f52767a650e75a29b0dfe7340e3d36d525c27efcc3cccdf06d8d950","schema_version":"1.0","event_id":"sha256:3b0ffccd1f52767a650e75a29b0dfe7340e3d36d525c27efcc3cccdf06d8d950"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EFBMTZ7E2D33CP7JG6ZZRY6RUG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing the partition function for cliques in a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","math.OC"],"primary_cat":"math.CO","authors_text":"Alexander Barvinok","submitted_at":"2014-05-08T15:36:39Z","abstract_excerpt":"We present a deterministic algorithm which, given a graph G with n vertices and an integer 1<m < n, computes in n^{O(ln m)} time the sum of weights w(S) over all m-subsets S of the set of vertices of G, where w(S)=exp{gamma t m +O(1/m)} provided exactly t{m choose 2} pairs of vertices of S span an edge of G for some 0 < t < 1. Here gamma >0 is an absolute constant: we can choose gamma=0.06, and if n > 4m and m > 10, we can choose gamma=0.18. This allows us to tell apart the graphs that do not have m-subsets of high density from the graphs that have sufficiently many m-subsets of high density, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1974","kind":"arxiv","version":3},"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:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epBmIa1JB+jmAfKrKlhNM4bpsYoo+mtwYAz7d63qz4uZYLqdGUV5gDUQ+bp64cSkh5zgnIjii7xqH7RoMOX2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:15:23.664390Z"},"content_sha256":"ecb5bdb84c6def0ec73da9f2b53513e107411746ccf198e5845ab1f9317b0c6d","schema_version":"1.0","event_id":"sha256:ecb5bdb84c6def0ec73da9f2b53513e107411746ccf198e5845ab1f9317b0c6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/bundle.json","state_url":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/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-10T07:15:23Z","links":{"resolver":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG","bundle":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/bundle.json","state":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EFBMTZ7E2D33CP7JG6ZZRY6RUG","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":"337b8f01f5591d276ba3cfb8f0c5fdfea751976bbb2af4c4eb8427029d9da668","cross_cats_sorted":["math-ph","math.MP","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-08T15:36:39Z","title_canon_sha256":"011aa7147ee61800a2fc5d99a5636804e4adc86b7a8d4bab38945a7397d4d73f"},"schema_version":"1.0","source":{"id":"1405.1974","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1974","created_at":"2026-05-18T02:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1974v3","created_at":"2026-05-18T02:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1974","created_at":"2026-05-18T02:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"EFBMTZ7E2D33","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EFBMTZ7E2D33CP7J","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EFBMTZ7E","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:ecb5bdb84c6def0ec73da9f2b53513e107411746ccf198e5845ab1f9317b0c6d","target":"graph","created_at":"2026-05-18T02:40:10Z","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 present a deterministic algorithm which, given a graph G with n vertices and an integer 1<m < n, computes in n^{O(ln m)} time the sum of weights w(S) over all m-subsets S of the set of vertices of G, where w(S)=exp{gamma t m +O(1/m)} provided exactly t{m choose 2} pairs of vertices of S span an edge of G for some 0 < t < 1. Here gamma >0 is an absolute constant: we can choose gamma=0.06, and if n > 4m and m > 10, we can choose gamma=0.18. This allows us to tell apart the graphs that do not have m-subsets of high density from the graphs that have sufficiently many m-subsets of high density, ","authors_text":"Alexander Barvinok","cross_cats":["math-ph","math.MP","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-08T15:36:39Z","title":"Computing the partition function for cliques in a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1974","kind":"arxiv","version":3},"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:3b0ffccd1f52767a650e75a29b0dfe7340e3d36d525c27efcc3cccdf06d8d950","target":"record","created_at":"2026-05-18T02:40:10Z","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":"337b8f01f5591d276ba3cfb8f0c5fdfea751976bbb2af4c4eb8427029d9da668","cross_cats_sorted":["math-ph","math.MP","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-08T15:36:39Z","title_canon_sha256":"011aa7147ee61800a2fc5d99a5636804e4adc86b7a8d4bab38945a7397d4d73f"},"schema_version":"1.0","source":{"id":"1405.1974","kind":"arxiv","version":3}},"canonical_sha256":"2142c9e7e4d0f7b13fe937b398e3d1a1b9b41edcc62fd61c359c12aa556c706c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2142c9e7e4d0f7b13fe937b398e3d1a1b9b41edcc62fd61c359c12aa556c706c","first_computed_at":"2026-05-18T02:40:10.509433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:10.509433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SK2WEEHCICL5dINCyfJgrl9E4WeIMllEmcIVR2GyOf5LR7wGgV2smM+E5ak19cKxFMDTtJn23Rk2oOntQtzTAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:10.509936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1974","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b0ffccd1f52767a650e75a29b0dfe7340e3d36d525c27efcc3cccdf06d8d950","sha256:ecb5bdb84c6def0ec73da9f2b53513e107411746ccf198e5845ab1f9317b0c6d"],"state_sha256":"6ef7bbed2ebf586b67ad4613e09d92d0f9968d4066c57e2f42a1db9d83b06f0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJlxNebd/ssiopn3H1HmY5C6V+O4W5X7W2a2c97en2JWjcDZR3GwMjXFy9FaHRByWyS8kG2OAQt7Pb0k+F0tCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:15:23.666726Z","bundle_sha256":"27e282a3eedba7cbae98c9b25a7d8c0708a09cee5f913236bf5c77425d856276"}}