{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3JUTV2UHFGJOCUTKBDTN4MLNZE","short_pith_number":"pith:3JUTV2UH","canonical_record":{"source":{"id":"2106.16130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-30T15:32:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a2e15cd51a27b5b9cd76d60fdb7fca91f3325de6961277dc8a25eefd63bc42e1","abstract_canon_sha256":"71d7f24067eee7ce233e3e4a16022659ecd94c077dd77dcdecaca98fdc92288c"},"schema_version":"1.0"},"canonical_sha256":"da693aea872992e1526a08e6de316dc92353d885ac6765b75969a4360f10171b","source":{"kind":"arxiv","id":"2106.16130","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.16130","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"2106.16130v2","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.16130","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"3JUTV2UHFGJO","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"pith_short_16","alias_value":"3JUTV2UHFGJOCUTK","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"pith_short_8","alias_value":"3JUTV2UH","created_at":"2026-07-05T05:20:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3JUTV2UHFGJOCUTKBDTN4MLNZE","target":"record","payload":{"canonical_record":{"source":{"id":"2106.16130","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-30T15:32:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a2e15cd51a27b5b9cd76d60fdb7fca91f3325de6961277dc8a25eefd63bc42e1","abstract_canon_sha256":"71d7f24067eee7ce233e3e4a16022659ecd94c077dd77dcdecaca98fdc92288c"},"schema_version":"1.0"},"canonical_sha256":"da693aea872992e1526a08e6de316dc92353d885ac6765b75969a4360f10171b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:07.978837Z","signature_b64":"PBfTpZJXA212SmGSsKICC4e5MTscsEntz28N7OptDLWRqjT6NbN6RdRUw+rOrEPqtzkTaRAPg1Z3Y+sywg+ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da693aea872992e1526a08e6de316dc92353d885ac6765b75969a4360f10171b","last_reissued_at":"2026-07-05T05:20:07.978413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:07.978413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.16130","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-07-05T05:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WK91wbOap9b9mxGh4N4z35a6ohTr8ofbMuYK0LuQR6fgSPo9t3UHaqltD+PNJRJllII1tfyBzBnQnwCPKt/nBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:35:32.230717Z"},"content_sha256":"d8f5aa0fd71a6a44bc586267fcabb4c6c79aa0711439be7176bef656ce3e22cb","schema_version":"1.0","event_id":"sha256:d8f5aa0fd71a6a44bc586267fcabb4c6c79aa0711439be7176bef656ce3e22cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3JUTV2UHFGJOCUTKBDTN4MLNZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diameter estimates for graph associahedra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon","submitted_at":"2021-06-30T15:32:12Z","abstract_excerpt":"Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph $G$ encodes the combinatorics of search trees on $G$, defined recursively by a root $r$ together with search trees on each of the connected components of $G-r$. In particular, the skeleton of the graph associahedron is the rotation graph of those search trees. We investigate the diameter of graph associahedra as a function of some graph parameters. We give a tight bound of $\\Theta(m)$ on the diameter of trivially perfect graph associahedra on $m$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.16130","kind":"arxiv","version":2},"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/2106.16130/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:20:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nghrMOCIITKE9pihgTbQTduw2DvzYNtLBQr8cewcUzCw8ANlCpO35b3sJEKKzZtW+9vTaD6DmKzSJri0IyGKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T08:35:32.231196Z"},"content_sha256":"368d2ba88ab7e91d6db6b16dc96fa9b3d2ec7bacad8048b3d6e0ac093575254b","schema_version":"1.0","event_id":"sha256:368d2ba88ab7e91d6db6b16dc96fa9b3d2ec7bacad8048b3d6e0ac093575254b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE/bundle.json","state_url":"https://pith.science/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE/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-08-04T08:35:32Z","links":{"resolver":"https://pith.science/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE","bundle":"https://pith.science/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE/bundle.json","state":"https://pith.science/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JUTV2UHFGJOCUTKBDTN4MLNZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3JUTV2UHFGJOCUTKBDTN4MLNZE","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":"71d7f24067eee7ce233e3e4a16022659ecd94c077dd77dcdecaca98fdc92288c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-30T15:32:12Z","title_canon_sha256":"a2e15cd51a27b5b9cd76d60fdb7fca91f3325de6961277dc8a25eefd63bc42e1"},"schema_version":"1.0","source":{"id":"2106.16130","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.16130","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"arxiv_version","alias_value":"2106.16130v2","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.16130","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"pith_short_12","alias_value":"3JUTV2UHFGJO","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"pith_short_16","alias_value":"3JUTV2UHFGJOCUTK","created_at":"2026-07-05T05:20:07Z"},{"alias_kind":"pith_short_8","alias_value":"3JUTV2UH","created_at":"2026-07-05T05:20:07Z"}],"graph_snapshots":[{"event_id":"sha256:368d2ba88ab7e91d6db6b16dc96fa9b3d2ec7bacad8048b3d6e0ac093575254b","target":"graph","created_at":"2026-07-05T05:20:07Z","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/2106.16130/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph $G$ encodes the combinatorics of search trees on $G$, defined recursively by a root $r$ together with search trees on each of the connected components of $G-r$. In particular, the skeleton of the graph associahedron is the rotation graph of those search trees. We investigate the diameter of graph associahedra as a function of some graph parameters. We give a tight bound of $\\Theta(m)$ on the diameter of trivially perfect graph associahedra on $m$","authors_text":"Jean Cardinal, Lionel Pournin, Mario Valencia-Pabon","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-30T15:32:12Z","title":"Diameter estimates for graph associahedra"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.16130","kind":"arxiv","version":2},"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:d8f5aa0fd71a6a44bc586267fcabb4c6c79aa0711439be7176bef656ce3e22cb","target":"record","created_at":"2026-07-05T05:20:07Z","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":"71d7f24067eee7ce233e3e4a16022659ecd94c077dd77dcdecaca98fdc92288c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-30T15:32:12Z","title_canon_sha256":"a2e15cd51a27b5b9cd76d60fdb7fca91f3325de6961277dc8a25eefd63bc42e1"},"schema_version":"1.0","source":{"id":"2106.16130","kind":"arxiv","version":2}},"canonical_sha256":"da693aea872992e1526a08e6de316dc92353d885ac6765b75969a4360f10171b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da693aea872992e1526a08e6de316dc92353d885ac6765b75969a4360f10171b","first_computed_at":"2026-07-05T05:20:07.978413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:20:07.978413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBfTpZJXA212SmGSsKICC4e5MTscsEntz28N7OptDLWRqjT6NbN6RdRUw+rOrEPqtzkTaRAPg1Z3Y+sywg+ZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:20:07.978837Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.16130","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8f5aa0fd71a6a44bc586267fcabb4c6c79aa0711439be7176bef656ce3e22cb","sha256:368d2ba88ab7e91d6db6b16dc96fa9b3d2ec7bacad8048b3d6e0ac093575254b"],"state_sha256":"ad32de4668f4454ec26ea29a61bf75cd2693321aaa6417e35793a55dd4cc352c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c/W+GxkBgRZxmnuoh5JWHVQoVtmkpDy/IO/Quzddc1gv4L6oJ4Sx3zFt2NLsyB0ioBIadCfLNq6BOgKHlC8LCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T08:35:32.239297Z","bundle_sha256":"632aa336e74c7de686456c20f52ad0ea1789af98a9d0a78bc543a9a535f0d6f0"}}