{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EFBMTZ7E2D33CP7JG6ZZRY6RUG","short_pith_number":"pith:EFBMTZ7E","schema_version":"1.0","canonical_sha256":"2142c9e7e4d0f7b13fe937b398e3d1a1b9b41edcc62fd61c359c12aa556c706c","source":{"kind":"arxiv","id":"1405.1974","version":3},"attestation_state":"computed","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, "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.1974","created_at":"2026-05-18T02:40:10.509507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1974v3","created_at":"2026-05-18T02:40:10.509507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1974","created_at":"2026-05-18T02:40:10.509507+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFBMTZ7E2D33","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFBMTZ7E2D33CP7J","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFBMTZ7E","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.21089","citing_title":"A rigorous quasipolynomial-time classical algorithm for SYK thermal expectations","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG","json":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG.json","graph_json":"https://pith.science/api/pith-number/EFBMTZ7E2D33CP7JG6ZZRY6RUG/graph.json","events_json":"https://pith.science/api/pith-number/EFBMTZ7E2D33CP7JG6ZZRY6RUG/events.json","paper":"https://pith.science/paper/EFBMTZ7E"},"agent_actions":{"view_html":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG","download_json":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG.json","view_paper":"https://pith.science/paper/EFBMTZ7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1974&json=true","fetch_graph":"https://pith.science/api/pith-number/EFBMTZ7E2D33CP7JG6ZZRY6RUG/graph.json","fetch_events":"https://pith.science/api/pith-number/EFBMTZ7E2D33CP7JG6ZZRY6RUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/action/storage_attestation","attest_author":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/action/author_attestation","sign_citation":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/action/citation_signature","submit_replication":"https://pith.science/pith/EFBMTZ7E2D33CP7JG6ZZRY6RUG/action/replication_record"}},"created_at":"2026-05-18T02:40:10.509507+00:00","updated_at":"2026-05-18T02:40:10.509507+00:00"}