{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TTLWZMQURBCQBN6LFQIZEJIVF3","short_pith_number":"pith:TTLWZMQU","canonical_record":{"source":{"id":"1406.3958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T10:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"08aeb72517baf7ff140b82e8a82a637279fe5c3ade7b0e7669c8e083571c8b33","abstract_canon_sha256":"d43c970facd7e8c2771fe69a8e923cd019c2d70bfc288f554f37cc27059ac2f2"},"schema_version":"1.0"},"canonical_sha256":"9cd76cb214884500b7cb2c119225152ef5de3a6ed385cc87c066e48cfe6ccc2f","source":{"kind":"arxiv","id":"1406.3958","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3958","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3958v2","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3958","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"pith_short_12","alias_value":"TTLWZMQURBCQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TTLWZMQURBCQBN6L","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TTLWZMQU","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TTLWZMQURBCQBN6LFQIZEJIVF3","target":"record","payload":{"canonical_record":{"source":{"id":"1406.3958","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T10:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"08aeb72517baf7ff140b82e8a82a637279fe5c3ade7b0e7669c8e083571c8b33","abstract_canon_sha256":"d43c970facd7e8c2771fe69a8e923cd019c2d70bfc288f554f37cc27059ac2f2"},"schema_version":"1.0"},"canonical_sha256":"9cd76cb214884500b7cb2c119225152ef5de3a6ed385cc87c066e48cfe6ccc2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:14.956161Z","signature_b64":"yOyZ2CzxLaL7Yv/gitEfgITEBS61CaYgnBWdgQLzUSVLfBei7JvPjs4zjEgcJt9VfoX2NnuIg5EowfLoIZo2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cd76cb214884500b7cb2c119225152ef5de3a6ed385cc87c066e48cfe6ccc2f","last_reissued_at":"2026-05-18T01:22:14.955483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:14.955483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.3958","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-05-18T01:22:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIgDWA4UlWFI/IKAJ6I75mIs/69mTCJZdGTkHBaGhpxALmK3w4/ZmxJdjscFDkoAEIZm4KSk9a5vjcAhmzBUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:20:22.756234Z"},"content_sha256":"bffda13b2045c8f8537252efb7d3838831c0fe543c079e5d0cd4227a0daa3ba3","schema_version":"1.0","event_id":"sha256:bffda13b2045c8f8537252efb7d3838831c0fe543c079e5d0cd4227a0daa3ba3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TTLWZMQURBCQBN6LFQIZEJIVF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On random trees obtained from permutation graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huseyin Acan, Pawel Hitczenko","submitted_at":"2014-06-16T10:29:08Z","abstract_excerpt":"A permutation $\\boldsymbol w$ gives rise to a graph $G_{\\boldsymbol w}$; the vertices of $G_{\\boldsymbol w}$ are the letters in the permutation and the edges of $G_{\\boldsymbol w}$ are the inversions of $\\boldsymbol w$. We find that the number of trees among permutation graphs with $n$ vertices is $2^{n-2}$ for $n\\ge 2$. We then study $T_n$, a uniformly random tree from this set of trees. In particular, we study the number of vertices of a given degree in $T_n$, the maximum degree in $T_n$, the diameter of $T_n$, and the domination number of $T_n$. Denoting the number of degree-$k$ vertices in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3958","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":""},"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-05-18T01:22:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyylHXhkk93YibeNj52r5IJ26nSquDn/x3KyndF5e9a5r9dxi3cB6KQ0jzlUFAcbruW76HYkFEufV3umZNNSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:20:22.756604Z"},"content_sha256":"a661257594875a0440e5c0ae45d10b73fec314bef0fc2300fb285a698537cdf1","schema_version":"1.0","event_id":"sha256:a661257594875a0440e5c0ae45d10b73fec314bef0fc2300fb285a698537cdf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTLWZMQURBCQBN6LFQIZEJIVF3/bundle.json","state_url":"https://pith.science/pith/TTLWZMQURBCQBN6LFQIZEJIVF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTLWZMQURBCQBN6LFQIZEJIVF3/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-03T00:20:22Z","links":{"resolver":"https://pith.science/pith/TTLWZMQURBCQBN6LFQIZEJIVF3","bundle":"https://pith.science/pith/TTLWZMQURBCQBN6LFQIZEJIVF3/bundle.json","state":"https://pith.science/pith/TTLWZMQURBCQBN6LFQIZEJIVF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTLWZMQURBCQBN6LFQIZEJIVF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TTLWZMQURBCQBN6LFQIZEJIVF3","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":"d43c970facd7e8c2771fe69a8e923cd019c2d70bfc288f554f37cc27059ac2f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T10:29:08Z","title_canon_sha256":"08aeb72517baf7ff140b82e8a82a637279fe5c3ade7b0e7669c8e083571c8b33"},"schema_version":"1.0","source":{"id":"1406.3958","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3958","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3958v2","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3958","created_at":"2026-05-18T01:22:14Z"},{"alias_kind":"pith_short_12","alias_value":"TTLWZMQURBCQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TTLWZMQURBCQBN6L","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TTLWZMQU","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:a661257594875a0440e5c0ae45d10b73fec314bef0fc2300fb285a698537cdf1","target":"graph","created_at":"2026-05-18T01:22:14Z","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"},"paper":{"abstract_excerpt":"A permutation $\\boldsymbol w$ gives rise to a graph $G_{\\boldsymbol w}$; the vertices of $G_{\\boldsymbol w}$ are the letters in the permutation and the edges of $G_{\\boldsymbol w}$ are the inversions of $\\boldsymbol w$. We find that the number of trees among permutation graphs with $n$ vertices is $2^{n-2}$ for $n\\ge 2$. We then study $T_n$, a uniformly random tree from this set of trees. In particular, we study the number of vertices of a given degree in $T_n$, the maximum degree in $T_n$, the diameter of $T_n$, and the domination number of $T_n$. Denoting the number of degree-$k$ vertices in","authors_text":"Huseyin Acan, Pawel Hitczenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T10:29:08Z","title":"On random trees obtained from permutation graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3958","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:bffda13b2045c8f8537252efb7d3838831c0fe543c079e5d0cd4227a0daa3ba3","target":"record","created_at":"2026-05-18T01:22:14Z","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":"d43c970facd7e8c2771fe69a8e923cd019c2d70bfc288f554f37cc27059ac2f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-16T10:29:08Z","title_canon_sha256":"08aeb72517baf7ff140b82e8a82a637279fe5c3ade7b0e7669c8e083571c8b33"},"schema_version":"1.0","source":{"id":"1406.3958","kind":"arxiv","version":2}},"canonical_sha256":"9cd76cb214884500b7cb2c119225152ef5de3a6ed385cc87c066e48cfe6ccc2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cd76cb214884500b7cb2c119225152ef5de3a6ed385cc87c066e48cfe6ccc2f","first_computed_at":"2026-05-18T01:22:14.955483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:14.955483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yOyZ2CzxLaL7Yv/gitEfgITEBS61CaYgnBWdgQLzUSVLfBei7JvPjs4zjEgcJt9VfoX2NnuIg5EowfLoIZo2CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:14.956161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3958","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bffda13b2045c8f8537252efb7d3838831c0fe543c079e5d0cd4227a0daa3ba3","sha256:a661257594875a0440e5c0ae45d10b73fec314bef0fc2300fb285a698537cdf1"],"state_sha256":"a4325c960278ee8b8c2ea71a82ce2ee531aa219f715e9882dd4d02586bc9d1f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QslrufQBD0/D8W73jCyytAJUzZXNS1eBtTx6X/XuahwEHu3n90Vvky5sNqytEyl7J+SD1ZfxYQI2ujaZlidbAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:20:22.758619Z","bundle_sha256":"43048f3f2884a5a247608b62a2c17af4f87ba5bb2b3790a90f1b70df803c0ee3"}}