{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WUZY26IE3QEQPG6WVT4TJYFTFB","short_pith_number":"pith:WUZY26IE","canonical_record":{"source":{"id":"2606.24326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T09:02:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bdedb6d45b5f541d3170cc50b5a47b8cc84ad8b2ee22e3430790b7ffd8df3909","abstract_canon_sha256":"78d555b6fad7bac2c90b79cfdb3fc6bed8df2829017523275dae4d235b1ff15d"},"schema_version":"1.0"},"canonical_sha256":"b5338d7904dc09079bd6acf934e0b3286dd0bb62ff41388def069353499c8bda","source":{"kind":"arxiv","id":"2606.24326","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24326","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24326v1","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24326","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"pith_short_12","alias_value":"WUZY26IE3QEQ","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"pith_short_16","alias_value":"WUZY26IE3QEQPG6W","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"pith_short_8","alias_value":"WUZY26IE","created_at":"2026-06-24T01:14:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WUZY26IE3QEQPG6WVT4TJYFTFB","target":"record","payload":{"canonical_record":{"source":{"id":"2606.24326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T09:02:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bdedb6d45b5f541d3170cc50b5a47b8cc84ad8b2ee22e3430790b7ffd8df3909","abstract_canon_sha256":"78d555b6fad7bac2c90b79cfdb3fc6bed8df2829017523275dae4d235b1ff15d"},"schema_version":"1.0"},"canonical_sha256":"b5338d7904dc09079bd6acf934e0b3286dd0bb62ff41388def069353499c8bda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:50.060942Z","signature_b64":"sm3HdI6cOidzVGyMijWOpiVBRa+t9wvWGOwRc4n41OYhG0Eqv7ab6sKeNUy03uOkhoJUyESHlWHn4aclUuQmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5338d7904dc09079bd6acf934e0b3286dd0bb62ff41388def069353499c8bda","last_reissued_at":"2026-06-24T01:14:50.060561Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:50.060561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.24326","source_version":1,"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-24T01:14:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEzlzJxK+1YCLCqpZMVMqXa3rznUc6YHZy3X7ppnvscqHpn5SnFZB6FTCM1sARqDxd44JPmy5WVWpN4fOV8uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T06:37:09.985603Z"},"content_sha256":"0e9c3bd39d762a57d8fad1bb2dea0fe70d32db300fdaa7edefe9000e29b7d862","schema_version":"1.0","event_id":"sha256:0e9c3bd39d762a57d8fad1bb2dea0fe70d32db300fdaa7edefe9000e29b7d862"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WUZY26IE3QEQPG6WVT4TJYFTFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Obstructions for Minor-Closed Classes of limiting Densities Below 3/2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Antonios Kominatos, Dimitrios M. Thilikos, Reem Mahmoud","submitted_at":"2026-06-23T09:02:50Z","abstract_excerpt":"Given a graph class $\\mathcal{G}$, the limiting density of $\\mathcal{G}$ is defined as $\\delta(\\mathcal{G})=\\lim_{n\\to\\infty} \\mathsf{ex}(\\mathcal{G},n)/n$ where $\\mathsf{ex}(\\mathcal{G},n)$ is the maximum number of edges of a graph in $\\mathcal{G}$ on $n$ vertices. The limiting density $\\delta(\\mathcal{G})$ is known to be a rational number when $\\mathcal{G}$ is a minor-closed graph class. For every $\\delta\\in[0,\\frac{3}{2})$, we prove that the set of $\\subseteq$-minimal minor-closed graph classes with densities $>\\delta$ is finite and we identify it completely. A consequence of our results is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24326","kind":"arxiv","version":1},"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/2606.24326/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-24T01:14:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eXa9mGUC/6hHeovojVx4/0EiUfLKTD1D/74mOzRrnieA86dZFqKx5RC7WCmmsP2X+mooqGt12vQ7cXSiZ1HAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T06:37:09.985979Z"},"content_sha256":"857fba4c284bf8f0b55652d56863bfc03dc6e332a4c33fd66c7a22eb2585b507","schema_version":"1.0","event_id":"sha256:857fba4c284bf8f0b55652d56863bfc03dc6e332a4c33fd66c7a22eb2585b507"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUZY26IE3QEQPG6WVT4TJYFTFB/bundle.json","state_url":"https://pith.science/pith/WUZY26IE3QEQPG6WVT4TJYFTFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUZY26IE3QEQPG6WVT4TJYFTFB/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-26T06:37:09Z","links":{"resolver":"https://pith.science/pith/WUZY26IE3QEQPG6WVT4TJYFTFB","bundle":"https://pith.science/pith/WUZY26IE3QEQPG6WVT4TJYFTFB/bundle.json","state":"https://pith.science/pith/WUZY26IE3QEQPG6WVT4TJYFTFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUZY26IE3QEQPG6WVT4TJYFTFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WUZY26IE3QEQPG6WVT4TJYFTFB","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":"78d555b6fad7bac2c90b79cfdb3fc6bed8df2829017523275dae4d235b1ff15d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T09:02:50Z","title_canon_sha256":"bdedb6d45b5f541d3170cc50b5a47b8cc84ad8b2ee22e3430790b7ffd8df3909"},"schema_version":"1.0","source":{"id":"2606.24326","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.24326","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"arxiv_version","alias_value":"2606.24326v1","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24326","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"pith_short_12","alias_value":"WUZY26IE3QEQ","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"pith_short_16","alias_value":"WUZY26IE3QEQPG6W","created_at":"2026-06-24T01:14:50Z"},{"alias_kind":"pith_short_8","alias_value":"WUZY26IE","created_at":"2026-06-24T01:14:50Z"}],"graph_snapshots":[{"event_id":"sha256:857fba4c284bf8f0b55652d56863bfc03dc6e332a4c33fd66c7a22eb2585b507","target":"graph","created_at":"2026-06-24T01:14:50Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.24326/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph class $\\mathcal{G}$, the limiting density of $\\mathcal{G}$ is defined as $\\delta(\\mathcal{G})=\\lim_{n\\to\\infty} \\mathsf{ex}(\\mathcal{G},n)/n$ where $\\mathsf{ex}(\\mathcal{G},n)$ is the maximum number of edges of a graph in $\\mathcal{G}$ on $n$ vertices. The limiting density $\\delta(\\mathcal{G})$ is known to be a rational number when $\\mathcal{G}$ is a minor-closed graph class. For every $\\delta\\in[0,\\frac{3}{2})$, we prove that the set of $\\subseteq$-minimal minor-closed graph classes with densities $>\\delta$ is finite and we identify it completely. A consequence of our results is","authors_text":"Antonios Kominatos, Dimitrios M. Thilikos, Reem Mahmoud","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T09:02:50Z","title":"Obstructions for Minor-Closed Classes of limiting Densities Below 3/2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24326","kind":"arxiv","version":1},"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:0e9c3bd39d762a57d8fad1bb2dea0fe70d32db300fdaa7edefe9000e29b7d862","target":"record","created_at":"2026-06-24T01:14:50Z","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":"78d555b6fad7bac2c90b79cfdb3fc6bed8df2829017523275dae4d235b1ff15d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T09:02:50Z","title_canon_sha256":"bdedb6d45b5f541d3170cc50b5a47b8cc84ad8b2ee22e3430790b7ffd8df3909"},"schema_version":"1.0","source":{"id":"2606.24326","kind":"arxiv","version":1}},"canonical_sha256":"b5338d7904dc09079bd6acf934e0b3286dd0bb62ff41388def069353499c8bda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5338d7904dc09079bd6acf934e0b3286dd0bb62ff41388def069353499c8bda","first_computed_at":"2026-06-24T01:14:50.060561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:14:50.060561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sm3HdI6cOidzVGyMijWOpiVBRa+t9wvWGOwRc4n41OYhG0Eqv7ab6sKeNUy03uOkhoJUyESHlWHn4aclUuQmBQ==","signature_status":"signed_v1","signed_at":"2026-06-24T01:14:50.060942Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.24326","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e9c3bd39d762a57d8fad1bb2dea0fe70d32db300fdaa7edefe9000e29b7d862","sha256:857fba4c284bf8f0b55652d56863bfc03dc6e332a4c33fd66c7a22eb2585b507"],"state_sha256":"27b4477604b06b4b8a377467ae468bbf7b15147b13cca61a2b9606e2960f4b87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lv+QWellnGbEVQjTTQLpmynJ7/DfpFzJTXOyPpU382uP/qgCBRNF6ZkxOWcRwX5eJVOfR31xbuOpVKbMN9kVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T06:37:09.987952Z","bundle_sha256":"db3b8e597a0cbd570fbcb278cd14bc402ab8737d0d8b9ea4b8bbe5915b23d870"}}