{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UOQUB2GABDQVOLJLI6KKNLFBWO","short_pith_number":"pith:UOQUB2GA","canonical_record":{"source":{"id":"1307.1886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-07T17:20:04Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"9430c75b3c85de0c8ef9eb5cf3f4be46e95abf6570639f593d667a6551413134","abstract_canon_sha256":"0932853ec34c43b68df38b7385f7a72ce9af010fde98d33550874f3721b36abd"},"schema_version":"1.0"},"canonical_sha256":"a3a140e8c008e1572d2b4794a6aca1b3bea8994eb124f342a9228aae01ae2979","source":{"kind":"arxiv","id":"1307.1886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1886","created_at":"2026-05-18T03:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1886v2","created_at":"2026-05-18T03:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1886","created_at":"2026-05-18T03:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"UOQUB2GABDQV","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UOQUB2GABDQVOLJL","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UOQUB2GA","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UOQUB2GABDQVOLJLI6KKNLFBWO","target":"record","payload":{"canonical_record":{"source":{"id":"1307.1886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-07T17:20:04Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"9430c75b3c85de0c8ef9eb5cf3f4be46e95abf6570639f593d667a6551413134","abstract_canon_sha256":"0932853ec34c43b68df38b7385f7a72ce9af010fde98d33550874f3721b36abd"},"schema_version":"1.0"},"canonical_sha256":"a3a140e8c008e1572d2b4794a6aca1b3bea8994eb124f342a9228aae01ae2979","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:11.482463Z","signature_b64":"YgEQdAJ2v+cxJK4V2AkEIiZHcFdZgxKPWhJdBPimdCOWutPqJBrqtPVFTjQ8JH+02nAVSmeX4dFy21i06kgiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3a140e8c008e1572d2b4794a6aca1b3bea8994eb124f342a9228aae01ae2979","last_reissued_at":"2026-05-18T03:12:11.481798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:11.481798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.1886","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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIxAR/BbtTVeo0LXg8xSfUF/kS2YJcpEjGFOjNsNrY3dXAM/8T5T0H/oGy6TOfAYAE/jftAKTcS6lUgHITjjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:48:27.534775Z"},"content_sha256":"d31920a177c79e7084890e35700b9e5170f009087a15c87e7724e64b959cf999","schema_version":"1.0","event_id":"sha256:d31920a177c79e7084890e35700b9e5170f009087a15c87e7724e64b959cf999"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UOQUB2GABDQVOLJLI6KKNLFBWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Estimates on the number of partially ordered sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Mikhail Kharitonov","submitted_at":"2013-07-07T17:20:04Z","abstract_excerpt":"Partially ordered sets of type (k, n) are the sets such that\n  a) cardinality of each set is n,\n  b) dimension of each set is two,\n  c) length of the maximal antichain in each set is k.\n  Let \\alpha_k(n) be the number of partially ordered sets of type (k, n). We prove that \\alpha_k(n)<min{k^{2n}/((k!)^2), (n-k+1)^{2n}/(((n-k)!)^2)}. Denote by \\xi_k(n) the number of permutations from S_n such that the maximal decreasing chain of such permutation has length k. We prove that \\xi_k(n)<k^{2n}/(((k-1)!)^2). We survey connections among the pairs of linear orders, the pairs Young diagrams, two-dimensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1886","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:12:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDswE4Mv8j6g5Q9Jnk3fhwjo2/FIwJ4X/trAZuJaqDhykbtNXlCBhIH2Ir6NSCtvL+bWXRVJvTcWMpzbmt9gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T08:48:27.535120Z"},"content_sha256":"a43f618eb10ec0a41cf534551f0330900bcf59e9c990c4e16257c01daabc9160","schema_version":"1.0","event_id":"sha256:a43f618eb10ec0a41cf534551f0330900bcf59e9c990c4e16257c01daabc9160"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOQUB2GABDQVOLJLI6KKNLFBWO/bundle.json","state_url":"https://pith.science/pith/UOQUB2GABDQVOLJLI6KKNLFBWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOQUB2GABDQVOLJLI6KKNLFBWO/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-28T08:48:27Z","links":{"resolver":"https://pith.science/pith/UOQUB2GABDQVOLJLI6KKNLFBWO","bundle":"https://pith.science/pith/UOQUB2GABDQVOLJLI6KKNLFBWO/bundle.json","state":"https://pith.science/pith/UOQUB2GABDQVOLJLI6KKNLFBWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOQUB2GABDQVOLJLI6KKNLFBWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UOQUB2GABDQVOLJLI6KKNLFBWO","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":"0932853ec34c43b68df38b7385f7a72ce9af010fde98d33550874f3721b36abd","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-07T17:20:04Z","title_canon_sha256":"9430c75b3c85de0c8ef9eb5cf3f4be46e95abf6570639f593d667a6551413134"},"schema_version":"1.0","source":{"id":"1307.1886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.1886","created_at":"2026-05-18T03:12:11Z"},{"alias_kind":"arxiv_version","alias_value":"1307.1886v2","created_at":"2026-05-18T03:12:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.1886","created_at":"2026-05-18T03:12:11Z"},{"alias_kind":"pith_short_12","alias_value":"UOQUB2GABDQV","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UOQUB2GABDQVOLJL","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UOQUB2GA","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:a43f618eb10ec0a41cf534551f0330900bcf59e9c990c4e16257c01daabc9160","target":"graph","created_at":"2026-05-18T03:12: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"},"paper":{"abstract_excerpt":"Partially ordered sets of type (k, n) are the sets such that\n  a) cardinality of each set is n,\n  b) dimension of each set is two,\n  c) length of the maximal antichain in each set is k.\n  Let \\alpha_k(n) be the number of partially ordered sets of type (k, n). We prove that \\alpha_k(n)<min{k^{2n}/((k!)^2), (n-k+1)^{2n}/(((n-k)!)^2)}. Denote by \\xi_k(n) the number of permutations from S_n such that the maximal decreasing chain of such permutation has length k. We prove that \\xi_k(n)<k^{2n}/(((k-1)!)^2). We survey connections among the pairs of linear orders, the pairs Young diagrams, two-dimensi","authors_text":"Mikhail Kharitonov","cross_cats":["math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-07T17:20:04Z","title":"Estimates on the number of partially ordered sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.1886","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:d31920a177c79e7084890e35700b9e5170f009087a15c87e7724e64b959cf999","target":"record","created_at":"2026-05-18T03:12: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":"0932853ec34c43b68df38b7385f7a72ce9af010fde98d33550874f3721b36abd","cross_cats_sorted":["math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-07T17:20:04Z","title_canon_sha256":"9430c75b3c85de0c8ef9eb5cf3f4be46e95abf6570639f593d667a6551413134"},"schema_version":"1.0","source":{"id":"1307.1886","kind":"arxiv","version":2}},"canonical_sha256":"a3a140e8c008e1572d2b4794a6aca1b3bea8994eb124f342a9228aae01ae2979","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3a140e8c008e1572d2b4794a6aca1b3bea8994eb124f342a9228aae01ae2979","first_computed_at":"2026-05-18T03:12:11.481798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:11.481798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YgEQdAJ2v+cxJK4V2AkEIiZHcFdZgxKPWhJdBPimdCOWutPqJBrqtPVFTjQ8JH+02nAVSmeX4dFy21i06kgiCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:11.482463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.1886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d31920a177c79e7084890e35700b9e5170f009087a15c87e7724e64b959cf999","sha256:a43f618eb10ec0a41cf534551f0330900bcf59e9c990c4e16257c01daabc9160"],"state_sha256":"14412b86004c0438faa988490b537c9b57e4f23571031f72cd95ac8c960039f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ko1ndePuBEY567aYCyn9noHUVrKcUMEvb3N1/aEZyXXK8W5Rf3peYACpGK3N4IXhRq1/cDfXhgzP3/O9uVzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T08:48:27.537120Z","bundle_sha256":"47622700acf8f806ec15efab4204a770b16e4789aba8faf576a46092cc9ff46a"}}