{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OVTYQJGQARTF7XLICVGZNPZ3U5","short_pith_number":"pith:OVTYQJGQ","canonical_record":{"source":{"id":"1611.03385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-10T16:27:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6cbcd11ff5bad44fb1fce465c7336d291b075250990b7b34d73e9fb4baace659","abstract_canon_sha256":"a116e9e7aa7526f0099d204f501e773d7f82220a31c83163ea2e5bb792a7fa33"},"schema_version":"1.0"},"canonical_sha256":"75678824d004665fdd68154d96bf3ba7463d3b1d91492a0e147cb2bafaae26e0","source":{"kind":"arxiv","id":"1611.03385","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03385","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03385v1","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03385","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"OVTYQJGQARTF","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"pith_short_16","alias_value":"OVTYQJGQARTF7XLI","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"pith_short_8","alias_value":"OVTYQJGQ","created_at":"2026-07-05T05:59:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OVTYQJGQARTF7XLICVGZNPZ3U5","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03385","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-10T16:27:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6cbcd11ff5bad44fb1fce465c7336d291b075250990b7b34d73e9fb4baace659","abstract_canon_sha256":"a116e9e7aa7526f0099d204f501e773d7f82220a31c83163ea2e5bb792a7fa33"},"schema_version":"1.0"},"canonical_sha256":"75678824d004665fdd68154d96bf3ba7463d3b1d91492a0e147cb2bafaae26e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:00.491251Z","signature_b64":"Iiax8jTUxwDjH/nKEPcZ1VQlmf7vtmZLUKmomcpeYKREAdZoXnY3rm6E9FvetcJt69gKHs9leCEnIXaLT1/0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75678824d004665fdd68154d96bf3ba7463d3b1d91492a0e147cb2bafaae26e0","last_reissued_at":"2026-07-05T05:59:00.490834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:00.490834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03385","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-07-05T05:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKZmXdXKdFn93qVhkxxgcycsr+sTJ02m58lilIW6WewASojzVirxF0j5dCx+lkAgucRrvwgjZ8VOZc6PGc3wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:43:47.061886Z"},"content_sha256":"fb808347180998333162006cea502fce94a341bfaf9d5b109f29e616927b9c52","schema_version":"1.0","event_id":"sha256:fb808347180998333162006cea502fce94a341bfaf9d5b109f29e616927b9c52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OVTYQJGQARTF7XLICVGZNPZ3U5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximately Sampling Elements with Fixed Rank in Graded Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Ben Cousins, Dana Randall, Matthew Fahrbach, Prateek Bhakta","submitted_at":"2016-11-10T16:27:09Z","abstract_excerpt":"Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\\#\\textbf{P}$-complete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse diagrams allow us to approximately generate samples with any fixed rank in expected polynomial time. Our arguments do not rely on the typical proofs of log-concavity, which are used to construct a stationary distribution with a spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03385","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1611.03385/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:59:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FV2exUHSREb3QxK7v+vEP1YSBptLXMvior3gQZ27M8J6upLVaWiDNpVP8ZUpFW0ejqnn8JQVq3A4TEzwcDYiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:43:47.062457Z"},"content_sha256":"cd4a537ade38c423fef25c05413a8b5b9cdf7bcddfc46bf18c11a48b564c050e","schema_version":"1.0","event_id":"sha256:cd4a537ade38c423fef25c05413a8b5b9cdf7bcddfc46bf18c11a48b564c050e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVTYQJGQARTF7XLICVGZNPZ3U5/bundle.json","state_url":"https://pith.science/pith/OVTYQJGQARTF7XLICVGZNPZ3U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVTYQJGQARTF7XLICVGZNPZ3U5/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-07-09T00:43:47Z","links":{"resolver":"https://pith.science/pith/OVTYQJGQARTF7XLICVGZNPZ3U5","bundle":"https://pith.science/pith/OVTYQJGQARTF7XLICVGZNPZ3U5/bundle.json","state":"https://pith.science/pith/OVTYQJGQARTF7XLICVGZNPZ3U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVTYQJGQARTF7XLICVGZNPZ3U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OVTYQJGQARTF7XLICVGZNPZ3U5","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":"a116e9e7aa7526f0099d204f501e773d7f82220a31c83163ea2e5bb792a7fa33","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-10T16:27:09Z","title_canon_sha256":"6cbcd11ff5bad44fb1fce465c7336d291b075250990b7b34d73e9fb4baace659"},"schema_version":"1.0","source":{"id":"1611.03385","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03385","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03385v1","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03385","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"pith_short_12","alias_value":"OVTYQJGQARTF","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"pith_short_16","alias_value":"OVTYQJGQARTF7XLI","created_at":"2026-07-05T05:59:00Z"},{"alias_kind":"pith_short_8","alias_value":"OVTYQJGQ","created_at":"2026-07-05T05:59:00Z"}],"graph_snapshots":[{"event_id":"sha256:cd4a537ade38c423fef25c05413a8b5b9cdf7bcddfc46bf18c11a48b564c050e","target":"graph","created_at":"2026-07-05T05:59:00Z","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/1611.03385/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\\#\\textbf{P}$-complete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse diagrams allow us to approximately generate samples with any fixed rank in expected polynomial time. Our arguments do not rely on the typical proofs of log-concavity, which are used to construct a stationary distribution with a spe","authors_text":"Ben Cousins, Dana Randall, Matthew Fahrbach, Prateek Bhakta","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-10T16:27:09Z","title":"Approximately Sampling Elements with Fixed Rank in Graded Posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03385","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:fb808347180998333162006cea502fce94a341bfaf9d5b109f29e616927b9c52","target":"record","created_at":"2026-07-05T05:59:00Z","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":"a116e9e7aa7526f0099d204f501e773d7f82220a31c83163ea2e5bb792a7fa33","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-10T16:27:09Z","title_canon_sha256":"6cbcd11ff5bad44fb1fce465c7336d291b075250990b7b34d73e9fb4baace659"},"schema_version":"1.0","source":{"id":"1611.03385","kind":"arxiv","version":1}},"canonical_sha256":"75678824d004665fdd68154d96bf3ba7463d3b1d91492a0e147cb2bafaae26e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75678824d004665fdd68154d96bf3ba7463d3b1d91492a0e147cb2bafaae26e0","first_computed_at":"2026-07-05T05:59:00.490834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:59:00.490834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iiax8jTUxwDjH/nKEPcZ1VQlmf7vtmZLUKmomcpeYKREAdZoXnY3rm6E9FvetcJt69gKHs9leCEnIXaLT1/0BA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:59:00.491251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03385","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb808347180998333162006cea502fce94a341bfaf9d5b109f29e616927b9c52","sha256:cd4a537ade38c423fef25c05413a8b5b9cdf7bcddfc46bf18c11a48b564c050e"],"state_sha256":"eeb59eb1790fec5d67d5bfac1c8b025cf0836ecc65ef232d57ef6a8137258097"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5b5mwQbWwTsd5VPv0IiuJ2qTFa219o/N7/rTkNO+gq7JyTMqsxNozagY0bdRgaM+iTBxkpNLlaeExchmfAm4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T00:43:47.065183Z","bundle_sha256":"f5a6dcdae36e49bfc6f8c89f85e26429f229bcecd471e41a1e4e7fd768fe0d93"}}