{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KEWXZPFJIVLK75ORYJZGA3FTC2","short_pith_number":"pith:KEWXZPFJ","schema_version":"1.0","canonical_sha256":"512d7cbca94556aff5d1c272606cb3168952b5705002b2fd0022340af075b13c","source":{"kind":"arxiv","id":"2211.02113","version":1},"attestation_state":"computed","paper":{"title":"P-graph Associahedra and Hypercube Graph Associahedra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jordan Almeter","submitted_at":"2022-11-03T19:33:04Z","abstract_excerpt":"A graph associahedron is a polytope dual to a simplicial complex whose elements are induced connected subgraphs called tubes. Graph associahedra generalize permutahedra, associahedra, and cyclohedra, and therefore are of great interest to those who study Coxeter combinatorics.\n  This thesis characterizes nested complexes of simplicial complexes, which we call $\\Delta$-nested complexes. From here, we can define P-nestohedra by truncating simple polyhedra, and in more specificity define P-graph associahedra, which are realized by repeated truncation of faces of simple polyhedra in accordance wit"},"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":"2211.02113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-03T19:33:04Z","cross_cats_sorted":[],"title_canon_sha256":"659ccf0b5019a279edba933bea27548de5a83de774525f583a99423f9dfe66b3","abstract_canon_sha256":"1da34f8374587d8075adf66a2d10b2efaaf41d254f9b367d545bb4f96d35e27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:11.703182Z","signature_b64":"429X7w0YXiJKNVCp3e5/47XwhcYaelrGrYX4GRR2t7S3AHGpaKmKH0y+nMg8VUnuGVnY5g/rAfdaRrRSAUEEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512d7cbca94556aff5d1c272606cb3168952b5705002b2fd0022340af075b13c","last_reissued_at":"2026-07-05T05:13:11.702694Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:11.702694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"P-graph Associahedra and Hypercube Graph Associahedra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jordan Almeter","submitted_at":"2022-11-03T19:33:04Z","abstract_excerpt":"A graph associahedron is a polytope dual to a simplicial complex whose elements are induced connected subgraphs called tubes. Graph associahedra generalize permutahedra, associahedra, and cyclohedra, and therefore are of great interest to those who study Coxeter combinatorics.\n  This thesis characterizes nested complexes of simplicial complexes, which we call $\\Delta$-nested complexes. From here, we can define P-nestohedra by truncating simple polyhedra, and in more specificity define P-graph associahedra, which are realized by repeated truncation of faces of simple polyhedra in accordance wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02113","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/2211.02113/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":"2211.02113","created_at":"2026-07-05T05:13:11.702760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.02113v1","created_at":"2026-07-05T05:13:11.702760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02113","created_at":"2026-07-05T05:13:11.702760+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEWXZPFJIVLK","created_at":"2026-07-05T05:13:11.702760+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEWXZPFJIVLK75OR","created_at":"2026-07-05T05:13:11.702760+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEWXZPFJ","created_at":"2026-07-05T05:13:11.702760+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26916","citing_title":"Polytopes and posets associated to preorders","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2","json":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2.json","graph_json":"https://pith.science/api/pith-number/KEWXZPFJIVLK75ORYJZGA3FTC2/graph.json","events_json":"https://pith.science/api/pith-number/KEWXZPFJIVLK75ORYJZGA3FTC2/events.json","paper":"https://pith.science/paper/KEWXZPFJ"},"agent_actions":{"view_html":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2","download_json":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2.json","view_paper":"https://pith.science/paper/KEWXZPFJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.02113&json=true","fetch_graph":"https://pith.science/api/pith-number/KEWXZPFJIVLK75ORYJZGA3FTC2/graph.json","fetch_events":"https://pith.science/api/pith-number/KEWXZPFJIVLK75ORYJZGA3FTC2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/action/storage_attestation","attest_author":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/action/author_attestation","sign_citation":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/action/citation_signature","submit_replication":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/action/replication_record"}},"created_at":"2026-07-05T05:13:11.702760+00:00","updated_at":"2026-07-05T05:13:11.702760+00:00"}