{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:FH5SJKMM6UQ7K4PVKFLS6IRMJJ","short_pith_number":"pith:FH5SJKMM","schema_version":"1.0","canonical_sha256":"29fb24a98cf521f571f551572f222c4a73089a8aabd605f57d1f166b99873817","source":{"kind":"arxiv","id":"2602.02450","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for multivariate independence polynomials and their generalisations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaehyeon Seo, Joonkyung Lee","submitted_at":"2026-02-02T18:43:44Z","abstract_excerpt":"In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence polynomial, i.e., the multiaffine generalisation of the independence polynomial, defined by $Z_G(\\lambda_1,\\dots,\\lambda_n) := \\sum_{I\\in\\mathcal{I}(G)} \\prod_{v\\in I}\\lambda_v$, where $\\mathcal{I}(G)$ denotes the set of all independent sets in a graph $G$ on $[n]:=\\{1,2,\\dots,n\\}$. We prove that for every simple graph $G$ on $[n]$ and $\\lambda_1,\\dots,\\lamb"},"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":"2602.02450","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-02-02T18:43:44Z","cross_cats_sorted":[],"title_canon_sha256":"60cf7bc2b42be5f4b441950fb69c49807ef93c5949b1cb57a603b8a22ffdc978","abstract_canon_sha256":"36669307bf55256e9b02553dfd8df45d061ac3ca97d0ad72c27890b87873f615"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:45:34.126147Z","signature_b64":"7a+t5Q8dajzV0Pkff0n7NX8PgGUOrhlsz1VcXPHmaV+SxZ1Bxjm27vdRFV+GME5ZTcIUc5SocL31mW4CTSXkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29fb24a98cf521f571f551572f222c4a73089a8aabd605f57d1f166b99873817","last_reissued_at":"2026-08-07T00:45:34.124593Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:45:34.124593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for multivariate independence polynomials and their generalisations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaehyeon Seo, Joonkyung Lee","submitted_at":"2026-02-02T18:43:44Z","abstract_excerpt":"In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence polynomial, i.e., the multiaffine generalisation of the independence polynomial, defined by $Z_G(\\lambda_1,\\dots,\\lambda_n) := \\sum_{I\\in\\mathcal{I}(G)} \\prod_{v\\in I}\\lambda_v$, where $\\mathcal{I}(G)$ denotes the set of all independent sets in a graph $G$ on $[n]:=\\{1,2,\\dots,n\\}$. We prove that for every simple graph $G$ on $[n]$ and $\\lambda_1,\\dots,\\lamb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.02450","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.02450/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2602.02450","created_at":"2026-08-07T00:45:34.125871+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.02450v2","created_at":"2026-08-07T00:45:34.125871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.02450","created_at":"2026-08-07T00:45:34.125871+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH5SJKMM6UQ7","created_at":"2026-08-07T00:45:34.125871+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH5SJKMM6UQ7K4PV","created_at":"2026-08-07T00:45:34.125871+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH5SJKMM","created_at":"2026-08-07T00:45:34.125871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":6,"sample":[{"citing_arxiv_id":"2607.06447","citing_title":"Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07779","citing_title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","ref_index":129,"is_internal_anchor":true},{"citing_arxiv_id":"2607.06447","citing_title":"Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory","ref_index":26,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03789","citing_title":"Automated Conjecture Resolution with Formal Verification","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"2604.17484","citing_title":"Matlas: A Semantic Search Engine for Mathematics","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05149","citing_title":"Degree-sequence bounds for independent sets via multivariate local occupancy","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ","json":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ.json","graph_json":"https://pith.science/api/pith-number/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/graph.json","events_json":"https://pith.science/api/pith-number/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/events.json","paper":"https://pith.science/paper/FH5SJKMM"},"agent_actions":{"view_html":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ","download_json":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ.json","view_paper":"https://pith.science/paper/FH5SJKMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.02450&json=true","fetch_graph":"https://pith.science/api/pith-number/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/action/storage_attestation","attest_author":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/action/author_attestation","sign_citation":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/action/citation_signature","submit_replication":"https://pith.science/pith/FH5SJKMM6UQ7K4PVKFLS6IRMJJ/action/replication_record"}},"created_at":"2026-08-07T00:45:34.125871+00:00","updated_at":"2026-08-07T00:45:34.125871+00:00"}