{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ZO6TK3K37QQYHKILOUTZFRPVJW","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":"66abe945d498b8977e585adce17a5a5b6576bb6aa1c54b117ad13fade74c0cde","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T09:50:44Z","title_canon_sha256":"0be255946458f283c3329c49d3f5aeea3ee72942d2e7db9c7cef96d43c5e088e"},"schema_version":"1.0","source":{"id":"2506.12424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12424","created_at":"2026-07-05T11:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12424v1","created_at":"2026-07-05T11:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12424","created_at":"2026-07-05T11:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"ZO6TK3K37QQY","created_at":"2026-07-05T11:21:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZO6TK3K37QQYHKIL","created_at":"2026-07-05T11:21:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZO6TK3K3","created_at":"2026-07-05T11:21:53Z"}],"graph_snapshots":[{"event_id":"sha256:bad98f0cf4c78ad2c1d8e63ee1af1e410352c2df966d4b6f278387d23b79af3b","target":"graph","created_at":"2026-07-05T11:21:53Z","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/2506.12424/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by a question of Galby, Munaro, and Yang (SoCG 2023) asking whether every graph class of bounded layered tree-independence number admits clique-based separators of sublinear weight, we investigate relations between layered tree-independence number, weight of clique-based separators, clique cover degeneracy and independence degeneracy. In particular, we provide a number of results bounding these parameters on geometric intersection graphs. For example, we show that the layered tree-independence number is $\\mathcal{O}(g)$ for $g$-map graphs, $\\mathcal{O}(\\frac{r}{\\tanh r})$ for hyperbo","authors_text":"Andrea Munaro, Cl\\'ement Dallard, Martin Milani\\v{c}, Shizhou Yang","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T09:50:44Z","title":"Layered tree-independence number and clique-based separators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12424","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:f24928aced82026593dfb4243cf4f1bbc6ef5b947b3eccc0b8946d4e4a304e51","target":"record","created_at":"2026-07-05T11:21:53Z","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":"66abe945d498b8977e585adce17a5a5b6576bb6aa1c54b117ad13fade74c0cde","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-14T09:50:44Z","title_canon_sha256":"0be255946458f283c3329c49d3f5aeea3ee72942d2e7db9c7cef96d43c5e088e"},"schema_version":"1.0","source":{"id":"2506.12424","kind":"arxiv","version":1}},"canonical_sha256":"cbbd356d5bfc2183a90b752792c5f54d96f44982d964afe8a379957a7641502d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbbd356d5bfc2183a90b752792c5f54d96f44982d964afe8a379957a7641502d","first_computed_at":"2026-07-05T11:21:53.121574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:21:53.121574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"voYpuVxQCJw8i8q2/WVEqaPwvAS90s4PMmwvhsq+XXUl3Q8mwyFJlIHZp+OLuHpN5+6QTXWO68sr+LJ6XAZgAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:21:53.122023Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.12424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f24928aced82026593dfb4243cf4f1bbc6ef5b947b3eccc0b8946d4e4a304e51","sha256:bad98f0cf4c78ad2c1d8e63ee1af1e410352c2df966d4b6f278387d23b79af3b"],"state_sha256":"1c3163fcf9e9e36ad4ae5ccc0339f1a2524c9cfcdef6c9cb471aed1c54524867"}