{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:A7YSVOQUWKK3XVNWTDO4VOSYAK","short_pith_number":"pith:A7YSVOQU","canonical_record":{"source":{"id":"2604.09768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-04-10T18:00:05Z","cross_cats_sorted":["hep-lat","hep-th"],"title_canon_sha256":"2362d46532179119e1d9e272ab6db4882907d6c2587e42e6314349da41c02a68","abstract_canon_sha256":"83824a8a4dbbb82f411728526b7d2672e0b21bba697ef7516eb12028ebf8e38b"},"schema_version":"1.0"},"canonical_sha256":"07f12aba14b295bbd5b698ddcaba58028a61d5672966f35f79042c807666589c","source":{"kind":"arxiv","id":"2604.09768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.09768","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"2604.09768v2","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.09768","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"A7YSVOQUWKK3","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_16","alias_value":"A7YSVOQUWKK3XVNW","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_8","alias_value":"A7YSVOQU","created_at":"2026-06-04T01:08:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:A7YSVOQUWKK3XVNWTDO4VOSYAK","target":"record","payload":{"canonical_record":{"source":{"id":"2604.09768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-04-10T18:00:05Z","cross_cats_sorted":["hep-lat","hep-th"],"title_canon_sha256":"2362d46532179119e1d9e272ab6db4882907d6c2587e42e6314349da41c02a68","abstract_canon_sha256":"83824a8a4dbbb82f411728526b7d2672e0b21bba697ef7516eb12028ebf8e38b"},"schema_version":"1.0"},"canonical_sha256":"07f12aba14b295bbd5b698ddcaba58028a61d5672966f35f79042c807666589c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:49.776737Z","signature_b64":"9RjdBrCMRnWayPYbSaagFPSZnpPXdQHECI26OTcIhRYYEvjeXvahS0zNJeMtJKaLXPIltHvin2I643yj6UUbAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07f12aba14b295bbd5b698ddcaba58028a61d5672966f35f79042c807666589c","last_reissued_at":"2026-06-04T01:08:49.776273Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:49.776273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.09768","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-06-04T01:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"suqVCtbp1w5KwXAXdRDkwkN8f6sVAh3Db2/35UYY37DG0CDjvezhVlpRsU1Y1MSWDWyEcdUiGAx1oFTefBjbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:24:51.499268Z"},"content_sha256":"dd97a9a7e1fb63975b7c16c6847a8961be1e9b0f3e45aad1350638bb87c955a2","schema_version":"1.0","event_id":"sha256:dd97a9a7e1fb63975b7c16c6847a8961be1e9b0f3e45aad1350638bb87c955a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:A7YSVOQUWKK3XVNWTDO4VOSYAK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof of entropic order in Generalized Ising Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Generalized Ising models with p at least 1 exhibit ordering at arbitrarily high temperatures, proven by mapping to maximum independent set problems on graphs.","cross_cats":["hep-lat","hep-th"],"primary_cat":"cond-mat.stat-mech","authors_text":"Emily Richards, Enrico Andriolo, Mendel Nguyen, Tin Sulejmanpasic","submitted_at":"2026-04-10T18:00:05Z","abstract_excerpt":"Ordering at arbitrarily high temperature - entropic order - has been argued to take place in a class of generalized Ising models parameterised by a real interaction parameter $p$ when $p\\ge 1$. We give a rigorous proof of this conjecture. We further show that on arbitrary graphs, these models solve graph packing problems - crucially, the Maximum Independent Set optimisation problem. Due to the NP-hardness of this packing problem on generic graphs, some lattice systems will exhibit glassy phases. We call this phenomenon $entropic$ $glass$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We give a rigorous proof of this conjecture [entropic order for p ≥ 1]. We further show that on arbitrary graphs, these models solve graph packing problems - crucially, the Maximum Independent Set optimisation problem.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The generalized Ising model is defined with a specific interaction form parameterized by real p, and the proof assumes this form allows the entropic ordering and graph-packing equivalence to hold for p ≥ 1 on arbitrary graphs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Rigorous proof establishes entropic order in generalized Ising models for p ≥ 1 and demonstrates they solve the NP-hard maximum independent set problem, leading to entropic glass phases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Generalized Ising models with p at least 1 exhibit ordering at arbitrarily high temperatures, proven by mapping to maximum independent set problems on graphs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0cb2867b3e0ae5ccc92e8b70a9f7b4d751ebc6d841615b2e51f433f95732c011"},"source":{"id":"2604.09768","kind":"arxiv","version":2},"verdict":{"id":"2b3ffe66-5e2a-4132-bd1c-dc154a4d59db","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T16:03:44.163155Z","strongest_claim":"We give a rigorous proof of this conjecture [entropic order for p ≥ 1]. We further show that on arbitrary graphs, these models solve graph packing problems - crucially, the Maximum Independent Set optimisation problem.","one_line_summary":"Rigorous proof establishes entropic order in generalized Ising models for p ≥ 1 and demonstrates they solve the NP-hard maximum independent set problem, leading to entropic glass phases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The generalized Ising model is defined with a specific interaction form parameterized by real p, and the proof assumes this form allows the entropic ordering and graph-packing equivalence to hold for p ≥ 1 on arbitrary graphs.","pith_extraction_headline":"Generalized Ising models with p at least 1 exhibit ordering at arbitrarily high temperatures, proven by mapping to maximum independent set problems on graphs."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.09768/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"},"verdict_id":"2b3ffe66-5e2a-4132-bd1c-dc154a4d59db"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-04T01:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1OxPKevXY3NxiJ8t10ECgUtcUe/CkRqUGh7055kfm/XzM2tjK1ekQI3lwaMS1zlArwTqiPYa2aLVvi1TDwc/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T13:24:51.500336Z"},"content_sha256":"c3373653ffe2a0f23c5b5307329cb43e6a3d5198a0721a1dfe93b25df59d19da","schema_version":"1.0","event_id":"sha256:c3373653ffe2a0f23c5b5307329cb43e6a3d5198a0721a1dfe93b25df59d19da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK/bundle.json","state_url":"https://pith.science/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK/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-10T13:24:51Z","links":{"resolver":"https://pith.science/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK","bundle":"https://pith.science/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK/bundle.json","state":"https://pith.science/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7YSVOQUWKK3XVNWTDO4VOSYAK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:A7YSVOQUWKK3XVNWTDO4VOSYAK","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":"83824a8a4dbbb82f411728526b7d2672e0b21bba697ef7516eb12028ebf8e38b","cross_cats_sorted":["hep-lat","hep-th"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-04-10T18:00:05Z","title_canon_sha256":"2362d46532179119e1d9e272ab6db4882907d6c2587e42e6314349da41c02a68"},"schema_version":"1.0","source":{"id":"2604.09768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.09768","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"2604.09768v2","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.09768","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"A7YSVOQUWKK3","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_16","alias_value":"A7YSVOQUWKK3XVNW","created_at":"2026-06-04T01:08:49Z"},{"alias_kind":"pith_short_8","alias_value":"A7YSVOQU","created_at":"2026-06-04T01:08:49Z"}],"graph_snapshots":[{"event_id":"sha256:c3373653ffe2a0f23c5b5307329cb43e6a3d5198a0721a1dfe93b25df59d19da","target":"graph","created_at":"2026-06-04T01:08:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We give a rigorous proof of this conjecture [entropic order for p ≥ 1]. We further show that on arbitrary graphs, these models solve graph packing problems - crucially, the Maximum Independent Set optimisation problem."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The generalized Ising model is defined with a specific interaction form parameterized by real p, and the proof assumes this form allows the entropic ordering and graph-packing equivalence to hold for p ≥ 1 on arbitrary graphs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Rigorous proof establishes entropic order in generalized Ising models for p ≥ 1 and demonstrates they solve the NP-hard maximum independent set problem, leading to entropic glass phases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Generalized Ising models with p at least 1 exhibit ordering at arbitrarily high temperatures, proven by mapping to maximum independent set problems on graphs."}],"snapshot_sha256":"0cb2867b3e0ae5ccc92e8b70a9f7b4d751ebc6d841615b2e51f433f95732c011"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.09768/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ordering at arbitrarily high temperature - entropic order - has been argued to take place in a class of generalized Ising models parameterised by a real interaction parameter $p$ when $p\\ge 1$. We give a rigorous proof of this conjecture. We further show that on arbitrary graphs, these models solve graph packing problems - crucially, the Maximum Independent Set optimisation problem. Due to the NP-hardness of this packing problem on generic graphs, some lattice systems will exhibit glassy phases. We call this phenomenon $entropic$ $glass$.","authors_text":"Emily Richards, Enrico Andriolo, Mendel Nguyen, Tin Sulejmanpasic","cross_cats":["hep-lat","hep-th"],"headline":"Generalized Ising models with p at least 1 exhibit ordering at arbitrarily high temperatures, proven by mapping to maximum independent set problems on graphs.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-04-10T18:00:05Z","title":"Proof of entropic order in Generalized Ising Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.09768","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T16:03:44.163155Z","id":"2b3ffe66-5e2a-4132-bd1c-dc154a4d59db","model_set":{"reader":"grok-4.3"},"one_line_summary":"Rigorous proof establishes entropic order in generalized Ising models for p ≥ 1 and demonstrates they solve the NP-hard maximum independent set problem, leading to entropic glass phases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Generalized Ising models with p at least 1 exhibit ordering at arbitrarily high temperatures, proven by mapping to maximum independent set problems on graphs.","strongest_claim":"We give a rigorous proof of this conjecture [entropic order for p ≥ 1]. We further show that on arbitrary graphs, these models solve graph packing problems - crucially, the Maximum Independent Set optimisation problem.","weakest_assumption":"The generalized Ising model is defined with a specific interaction form parameterized by real p, and the proof assumes this form allows the entropic ordering and graph-packing equivalence to hold for p ≥ 1 on arbitrary graphs."}},"verdict_id":"2b3ffe66-5e2a-4132-bd1c-dc154a4d59db"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dd97a9a7e1fb63975b7c16c6847a8961be1e9b0f3e45aad1350638bb87c955a2","target":"record","created_at":"2026-06-04T01:08:49Z","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":"83824a8a4dbbb82f411728526b7d2672e0b21bba697ef7516eb12028ebf8e38b","cross_cats_sorted":["hep-lat","hep-th"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2026-04-10T18:00:05Z","title_canon_sha256":"2362d46532179119e1d9e272ab6db4882907d6c2587e42e6314349da41c02a68"},"schema_version":"1.0","source":{"id":"2604.09768","kind":"arxiv","version":2}},"canonical_sha256":"07f12aba14b295bbd5b698ddcaba58028a61d5672966f35f79042c807666589c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07f12aba14b295bbd5b698ddcaba58028a61d5672966f35f79042c807666589c","first_computed_at":"2026-06-04T01:08:49.776273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:49.776273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9RjdBrCMRnWayPYbSaagFPSZnpPXdQHECI26OTcIhRYYEvjeXvahS0zNJeMtJKaLXPIltHvin2I643yj6UUbAQ==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:49.776737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.09768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd97a9a7e1fb63975b7c16c6847a8961be1e9b0f3e45aad1350638bb87c955a2","sha256:c3373653ffe2a0f23c5b5307329cb43e6a3d5198a0721a1dfe93b25df59d19da"],"state_sha256":"a63bfe8cf4ebf8198fd95ccfc1d557a2c2e485cf29b27d25242069be9fd8f710"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aa16w9JQx3HCPJwQCZfduFDTK8iaf1QQ9wYXIATqoQjrDbTv5rl28JVgn4S5Zm9VMjm5Yr8CtS5UrVSQajviCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T13:24:51.505591Z","bundle_sha256":"c5b7f976cbf17c1c991a52a3106926f7098cd627371c2006f7ee5ff9e77e000f"}}