{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5N5H4IJKONFOI3ESICUXLG7GQ7","short_pith_number":"pith:5N5H4IJK","canonical_record":{"source":{"id":"1206.6354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T18:04:46Z","cross_cats_sorted":[],"title_canon_sha256":"2a52c6de3fd913a272c590bfc3c566b65aa4aba9945917d49d68334e29c69fa0","abstract_canon_sha256":"7758dd356e2447670409ddb4db1e4e2aebd7466e6bf604771fc71edc8e123bcb"},"schema_version":"1.0"},"canonical_sha256":"eb7a7e212a734ae46c9240a9759be687e9c0ac7b3fbbd84ad804e2fd35d3451d","source":{"kind":"arxiv","id":"1206.6354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6354","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6354v1","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6354","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"5N5H4IJKONFO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5N5H4IJKONFOI3ES","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5N5H4IJK","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5N5H4IJKONFOI3ESICUXLG7GQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T18:04:46Z","cross_cats_sorted":[],"title_canon_sha256":"2a52c6de3fd913a272c590bfc3c566b65aa4aba9945917d49d68334e29c69fa0","abstract_canon_sha256":"7758dd356e2447670409ddb4db1e4e2aebd7466e6bf604771fc71edc8e123bcb"},"schema_version":"1.0"},"canonical_sha256":"eb7a7e212a734ae46c9240a9759be687e9c0ac7b3fbbd84ad804e2fd35d3451d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:26.901393Z","signature_b64":"XY0H05CsPSr1jwrHYYrBZX1x4gBl2OLVrhgsrLnShiMsJKAMTtHsyJ3AivpVD11ynyPlWwj8P8av2lkzcAMtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb7a7e212a734ae46c9240a9759be687e9c0ac7b3fbbd84ad804e2fd35d3451d","last_reissued_at":"2026-05-18T03:52:26.900804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:26.900804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6354","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-05-18T03:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaN7o29a3FKoM+kDiNTyknphMMwYOvjqJVn14XsSRAL6jFZ6dZ1AByNnvJ+Rr2p4m6T4/N42El1wbLbebPwfAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T00:55:25.165157Z"},"content_sha256":"06f4199cb5b5d341d923a1899d14610b609f0c3b430752a7b809702021cd377f","schema_version":"1.0","event_id":"sha256:06f4199cb5b5d341d923a1899d14610b609f0c3b430752a7b809702021cd377f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5N5H4IJKONFOI3ESICUXLG7GQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Barred Preferential Arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger","submitted_at":"2012-06-27T18:04:46Z","abstract_excerpt":"A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with respect to one or more bars. We present various combinatorial identities for r_{m,l}, the number of barred preferential arrangements of l elements with m bars, using both algebraic and combinatorial arguments. Our main result is an expression for r_{m,l} as a linear combination of the r_k (= r_{0,k}, the number of unbarred preferential arrangements of k elements)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6354","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":""},"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:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzBASSc+2QN/qKonS0grgG5jDmrvWDrlH3cLXZ9r6Xx27aHZ8yxbUDV0fQUBVt79XhXYeDMgaBb9uFJEzWtXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T00:55:25.165516Z"},"content_sha256":"173d1bc90b89b33c1dd80dbae73dd714540a937cceb231ae815c7766ecb0af53","schema_version":"1.0","event_id":"sha256:173d1bc90b89b33c1dd80dbae73dd714540a937cceb231ae815c7766ecb0af53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5N5H4IJKONFOI3ESICUXLG7GQ7/bundle.json","state_url":"https://pith.science/pith/5N5H4IJKONFOI3ESICUXLG7GQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5N5H4IJKONFOI3ESICUXLG7GQ7/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-30T00:55:25Z","links":{"resolver":"https://pith.science/pith/5N5H4IJKONFOI3ESICUXLG7GQ7","bundle":"https://pith.science/pith/5N5H4IJKONFOI3ESICUXLG7GQ7/bundle.json","state":"https://pith.science/pith/5N5H4IJKONFOI3ESICUXLG7GQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5N5H4IJKONFOI3ESICUXLG7GQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5N5H4IJKONFOI3ESICUXLG7GQ7","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":"7758dd356e2447670409ddb4db1e4e2aebd7466e6bf604771fc71edc8e123bcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T18:04:46Z","title_canon_sha256":"2a52c6de3fd913a272c590bfc3c566b65aa4aba9945917d49d68334e29c69fa0"},"schema_version":"1.0","source":{"id":"1206.6354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6354","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6354v1","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6354","created_at":"2026-05-18T03:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"5N5H4IJKONFO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"5N5H4IJKONFOI3ES","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"5N5H4IJK","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:173d1bc90b89b33c1dd80dbae73dd714540a937cceb231ae815c7766ecb0af53","target":"graph","created_at":"2026-05-18T03:52:26Z","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 preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with respect to one or more bars. We present various combinatorial identities for r_{m,l}, the number of barred preferential arrangements of l elements with m bars, using both algebraic and combinatorial arguments. Our main result is an expression for r_{m,l} as a linear combination of the r_k (= r_{0,k}, the number of unbarred preferential arrangements of k elements)","authors_text":"Connor Ahlbach, Jeremy Usatine, Nicholas Pippenger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T18:04:46Z","title":"Barred Preferential Arrangements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6354","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:06f4199cb5b5d341d923a1899d14610b609f0c3b430752a7b809702021cd377f","target":"record","created_at":"2026-05-18T03:52:26Z","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":"7758dd356e2447670409ddb4db1e4e2aebd7466e6bf604771fc71edc8e123bcb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-27T18:04:46Z","title_canon_sha256":"2a52c6de3fd913a272c590bfc3c566b65aa4aba9945917d49d68334e29c69fa0"},"schema_version":"1.0","source":{"id":"1206.6354","kind":"arxiv","version":1}},"canonical_sha256":"eb7a7e212a734ae46c9240a9759be687e9c0ac7b3fbbd84ad804e2fd35d3451d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb7a7e212a734ae46c9240a9759be687e9c0ac7b3fbbd84ad804e2fd35d3451d","first_computed_at":"2026-05-18T03:52:26.900804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:26.900804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XY0H05CsPSr1jwrHYYrBZX1x4gBl2OLVrhgsrLnShiMsJKAMTtHsyJ3AivpVD11ynyPlWwj8P8av2lkzcAMtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:26.901393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06f4199cb5b5d341d923a1899d14610b609f0c3b430752a7b809702021cd377f","sha256:173d1bc90b89b33c1dd80dbae73dd714540a937cceb231ae815c7766ecb0af53"],"state_sha256":"caf81d5e84e49ec04e4cfecae7074d5b82959c324a41c565e5a75c31e97348b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8oKbrChK9tw56ivTsDR2A+b0ekr7atvKe2YiMmrTFk1FUONroDwPMWQnSFaEaw2tZ/Vtd8R5VegLYfi2eruAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T00:55:25.167474Z","bundle_sha256":"adf2b4764e5d0c14e5b1a6bfe3be820f847af4486c7f7c17c858d038c5d37461"}}