{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:KEWXZPFJIVLK75ORYJZGA3FTC2","short_pith_number":"pith:KEWXZPFJ","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"},"canonical_sha256":"512d7cbca94556aff5d1c272606cb3168952b5705002b2fd0022340af075b13c","source":{"kind":"arxiv","id":"2211.02113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02113","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02113v1","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02113","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"KEWXZPFJIVLK","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"KEWXZPFJIVLK75OR","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"KEWXZPFJ","created_at":"2026-07-05T05:13:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:KEWXZPFJIVLK75ORYJZGA3FTC2","target":"record","payload":{"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"},"canonical_sha256":"512d7cbca94556aff5d1c272606cb3168952b5705002b2fd0022340af075b13c","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"},"source_kind":"arxiv","source_id":"2211.02113","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-07-05T05:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kkn3vhYs975JS+bgfhM61pg/+kUlDEmeLaTGSSlNDJOz/wbZCeja83lQxXJUwvY8m9b+pwhdqEicIGLfX1xKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T03:09:13.006524Z"},"content_sha256":"ce80728e0288af15ae964f7a26d73b23b2d0a04f423db5877c40973e6d390848","schema_version":"1.0","event_id":"sha256:ce80728e0288af15ae964f7a26d73b23b2d0a04f423db5877c40973e6d390848"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:KEWXZPFJIVLK75ORYJZGA3FTC2","target":"graph","payload":{"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"},"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-07-05T05:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nK+KVsYGbszh54CUH0X0EsoC4i/qq0QDAS8EqHXK2H8UPfCEPxw2VUf707ndQkdD9it5rFQFP+cPkl6TMRe+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T03:09:13.006901Z"},"content_sha256":"0d283ac2b3714600d781602297e344c4a012ba319c093f9685821def7a7a1292","schema_version":"1.0","event_id":"sha256:0d283ac2b3714600d781602297e344c4a012ba319c093f9685821def7a7a1292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/bundle.json","state_url":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/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-07-16T03:09:13Z","links":{"resolver":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2","bundle":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/bundle.json","state":"https://pith.science/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEWXZPFJIVLK75ORYJZGA3FTC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:KEWXZPFJIVLK75ORYJZGA3FTC2","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":"1da34f8374587d8075adf66a2d10b2efaaf41d254f9b367d545bb4f96d35e27d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-03T19:33:04Z","title_canon_sha256":"659ccf0b5019a279edba933bea27548de5a83de774525f583a99423f9dfe66b3"},"schema_version":"1.0","source":{"id":"2211.02113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02113","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02113v1","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02113","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"KEWXZPFJIVLK","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"pith_short_16","alias_value":"KEWXZPFJIVLK75OR","created_at":"2026-07-05T05:13:11Z"},{"alias_kind":"pith_short_8","alias_value":"KEWXZPFJ","created_at":"2026-07-05T05:13:11Z"}],"graph_snapshots":[{"event_id":"sha256:0d283ac2b3714600d781602297e344c4a012ba319c093f9685821def7a7a1292","target":"graph","created_at":"2026-07-05T05:13:11Z","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/2211.02113/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jordan Almeter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-03T19:33:04Z","title":"P-graph Associahedra and Hypercube Graph Associahedra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02113","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:ce80728e0288af15ae964f7a26d73b23b2d0a04f423db5877c40973e6d390848","target":"record","created_at":"2026-07-05T05:13:11Z","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":"1da34f8374587d8075adf66a2d10b2efaaf41d254f9b367d545bb4f96d35e27d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-03T19:33:04Z","title_canon_sha256":"659ccf0b5019a279edba933bea27548de5a83de774525f583a99423f9dfe66b3"},"schema_version":"1.0","source":{"id":"2211.02113","kind":"arxiv","version":1}},"canonical_sha256":"512d7cbca94556aff5d1c272606cb3168952b5705002b2fd0022340af075b13c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512d7cbca94556aff5d1c272606cb3168952b5705002b2fd0022340af075b13c","first_computed_at":"2026-07-05T05:13:11.702694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:11.702694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"429X7w0YXiJKNVCp3e5/47XwhcYaelrGrYX4GRR2t7S3AHGpaKmKH0y+nMg8VUnuGVnY5g/rAfdaRrRSAUEEDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:11.703182Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce80728e0288af15ae964f7a26d73b23b2d0a04f423db5877c40973e6d390848","sha256:0d283ac2b3714600d781602297e344c4a012ba319c093f9685821def7a7a1292"],"state_sha256":"107739626ed68590786cd3ca84467dcebacf6ba12bb6251de9c796fdf951956e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1kPp+OCUBt22pK784z0QtmgLJnW7nUD0cbdQ9dSZlUAvtslmd9tqJob22u2HMhydX9+ME6bU1VQGqny8Vf9IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T03:09:13.009870Z","bundle_sha256":"77bf065bebc92beae5dc5af40bb968496ccd4796497cd2d7a3d311f820c949f8"}}