{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:A5ODDMCEHRUVBJGZAKED6HZAMK","short_pith_number":"pith:A5ODDMCE","canonical_record":{"source":{"id":"1110.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-02T09:05:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f262c76653e42be7ae166bfa9fcfbb8540febc13e5e902accb3de6a23dc83eb3","abstract_canon_sha256":"cf8131549c80a6acf0884e07d35e1c3e17e4f9dc5856575b4ef327c855797602"},"schema_version":"1.0"},"canonical_sha256":"075c31b0443c6950a4d902883f1f2062b1b37c7664772b90b22121a5c566d39d","source":{"kind":"arxiv","id":"1110.0160","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0160","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0160v2","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0160","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"A5ODDMCEHRUV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A5ODDMCEHRUVBJGZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A5ODDMCE","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:A5ODDMCEHRUVBJGZAKED6HZAMK","target":"record","payload":{"canonical_record":{"source":{"id":"1110.0160","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-02T09:05:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f262c76653e42be7ae166bfa9fcfbb8540febc13e5e902accb3de6a23dc83eb3","abstract_canon_sha256":"cf8131549c80a6acf0884e07d35e1c3e17e4f9dc5856575b4ef327c855797602"},"schema_version":"1.0"},"canonical_sha256":"075c31b0443c6950a4d902883f1f2062b1b37c7664772b90b22121a5c566d39d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:25.792121Z","signature_b64":"3JXGjycDHmS5j/f7oSmu1Iw0iMWPXkAGDdOsVoQhSeC6C/o0DPBITN7cH4W0A5rHq4tmuslkVsO+cHCGTo2ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"075c31b0443c6950a4d902883f1f2062b1b37c7664772b90b22121a5c566d39d","last_reissued_at":"2026-05-18T03:40:25.791384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:25.791384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.0160","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-18T03:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRlmwFo4bEB3pBW6bACMRPT3LS3sEZHhEmhkqhHMxd0bE+cd0CK2ynIYmCT35zRZIFO8zJK3748Buq6HJH5SBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:18:51.852524Z"},"content_sha256":"1e4c4e54ef33bdc94346a43d1a799ab513f81492e6e6aefe8e2f9ab166694acb","schema_version":"1.0","event_id":"sha256:1e4c4e54ef33bdc94346a43d1a799ab513f81492e6e6aefe8e2f9ab166694acb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:A5ODDMCEHRUVBJGZAKED6HZAMK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A pattern theorem for random sorting networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Alexander E. Holroyd, Omer Angel, Vadim Gorin","submitted_at":"2011-10-02T09:05:47Z","abstract_excerpt":"A sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove that in a uniformly random n-element sorting network, any fixed pattern occurs in at least cn^2 disjoint space-time locations, with probability tending to 1 exponentially fast as n tends to infinity. Here c is a positive constant which depends on the choice of pattern. As a consequence, the probability that the uniformly random sorting network is geometricall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0160","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-18T03:40:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYDpYtbo9f+HJEK1FmCZLddSpO1tMfaQmqDwn32HT511E/CkpKoFAzHpr3sSUB0ZgU/OSCDxauOcUFfASjENCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:18:51.852892Z"},"content_sha256":"e41304a06c9bbf55cbe7bd0427e612aa6c78407ce59dc2704a282dabaf1868b9","schema_version":"1.0","event_id":"sha256:e41304a06c9bbf55cbe7bd0427e612aa6c78407ce59dc2704a282dabaf1868b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5ODDMCEHRUVBJGZAKED6HZAMK/bundle.json","state_url":"https://pith.science/pith/A5ODDMCEHRUVBJGZAKED6HZAMK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5ODDMCEHRUVBJGZAKED6HZAMK/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-07T20:18:51Z","links":{"resolver":"https://pith.science/pith/A5ODDMCEHRUVBJGZAKED6HZAMK","bundle":"https://pith.science/pith/A5ODDMCEHRUVBJGZAKED6HZAMK/bundle.json","state":"https://pith.science/pith/A5ODDMCEHRUVBJGZAKED6HZAMK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5ODDMCEHRUVBJGZAKED6HZAMK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:A5ODDMCEHRUVBJGZAKED6HZAMK","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":"cf8131549c80a6acf0884e07d35e1c3e17e4f9dc5856575b4ef327c855797602","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-02T09:05:47Z","title_canon_sha256":"f262c76653e42be7ae166bfa9fcfbb8540febc13e5e902accb3de6a23dc83eb3"},"schema_version":"1.0","source":{"id":"1110.0160","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0160","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0160v2","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0160","created_at":"2026-05-18T03:40:25Z"},{"alias_kind":"pith_short_12","alias_value":"A5ODDMCEHRUV","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"A5ODDMCEHRUVBJGZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"A5ODDMCE","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:e41304a06c9bbf55cbe7bd0427e612aa6c78407ce59dc2704a282dabaf1868b9","target":"graph","created_at":"2026-05-18T03:40:25Z","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 sorting network is a shortest path from 12..n to n..21 in the Cayley graph of the symmetric group S(n) generated by nearest-neighbor swaps. A pattern is a sequence of swaps that forms an initial segment of some sorting network. We prove that in a uniformly random n-element sorting network, any fixed pattern occurs in at least cn^2 disjoint space-time locations, with probability tending to 1 exponentially fast as n tends to infinity. Here c is a positive constant which depends on the choice of pattern. As a consequence, the probability that the uniformly random sorting network is geometricall","authors_text":"Alexander E. Holroyd, Omer Angel, Vadim Gorin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-02T09:05:47Z","title":"A pattern theorem for random sorting networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0160","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:1e4c4e54ef33bdc94346a43d1a799ab513f81492e6e6aefe8e2f9ab166694acb","target":"record","created_at":"2026-05-18T03:40:25Z","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":"cf8131549c80a6acf0884e07d35e1c3e17e4f9dc5856575b4ef327c855797602","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-10-02T09:05:47Z","title_canon_sha256":"f262c76653e42be7ae166bfa9fcfbb8540febc13e5e902accb3de6a23dc83eb3"},"schema_version":"1.0","source":{"id":"1110.0160","kind":"arxiv","version":2}},"canonical_sha256":"075c31b0443c6950a4d902883f1f2062b1b37c7664772b90b22121a5c566d39d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"075c31b0443c6950a4d902883f1f2062b1b37c7664772b90b22121a5c566d39d","first_computed_at":"2026-05-18T03:40:25.791384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:25.791384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3JXGjycDHmS5j/f7oSmu1Iw0iMWPXkAGDdOsVoQhSeC6C/o0DPBITN7cH4W0A5rHq4tmuslkVsO+cHCGTo2ZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:25.792121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0160","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e4c4e54ef33bdc94346a43d1a799ab513f81492e6e6aefe8e2f9ab166694acb","sha256:e41304a06c9bbf55cbe7bd0427e612aa6c78407ce59dc2704a282dabaf1868b9"],"state_sha256":"ea2574827db25a8237d4bee663bfa8fcc8517e3479a5bdcc78ce8424bb75bc69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wVxOLd4vrKLS5VUcLu1d2gdXBziwjd92/hoTTaU2eOzDyUxnh6AUkMt9547UL5v3kuSD/w5TYYAk4GXbGgF4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:18:51.855137Z","bundle_sha256":"6c57a62ba54013cd68985082af403cd99b483c44f3de54c72fa8027ddfb3878c"}}