{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DMAQR5WXZ5DBNS4LHII4JC5PTQ","short_pith_number":"pith:DMAQR5WX","schema_version":"1.0","canonical_sha256":"1b0108f6d7cf4616cb8b3a11c48baf9c050683b0b77940f3331177c1135d0c6f","source":{"kind":"arxiv","id":"1607.08806","version":6},"attestation_state":"computed","paper":{"title":"Trimming and gluing Gray codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Petr Gregor, Torsten M\\\"utze","submitted_at":"2016-07-29T13:42:37Z","abstract_excerpt":"We consider the algorithmic problem of generating each subset of $[n]:=\\{1,2,\\ldots,n\\}$ whose size is in some interval $[k,l]$, $0\\leq k\\leq l\\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by exchanging a single element. For $k=0$ and $l=n$ this is the classical problem of generating all $2^n$ subsets of $[n]$ by element additions/removals, and for $k=l$ this is the classical problem of generating all $\\binom{n}{k}$ subsets of $[n]$ by element exchanges. We prove the existence of such cyclic minimum-change enumerations for a large range of values $n$,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.08806","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-29T13:42:37Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"7af7b4c0050c999c0134cf16bc55c9bb3146566224836a285946d3437c3f62c1","abstract_canon_sha256":"edb639693a9cf64622dff22062179071801ef2450eb0204f8699de4856172aa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:17.237885Z","signature_b64":"lN/7NPeDIOm+ELSh3H8G71AXjfin/o3nBf7RSv390BMZ6j9wdOV8g2rvzhO/Vy0wmPVszjlcvgRc/eDdIn2mBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b0108f6d7cf4616cb8b3a11c48baf9c050683b0b77940f3331177c1135d0c6f","last_reissued_at":"2026-05-18T00:23:17.237348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:17.237348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trimming and gluing Gray codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Petr Gregor, Torsten M\\\"utze","submitted_at":"2016-07-29T13:42:37Z","abstract_excerpt":"We consider the algorithmic problem of generating each subset of $[n]:=\\{1,2,\\ldots,n\\}$ whose size is in some interval $[k,l]$, $0\\leq k\\leq l\\leq n$, exactly once (cyclically) by repeatedly adding or removing a single element, or by exchanging a single element. For $k=0$ and $l=n$ this is the classical problem of generating all $2^n$ subsets of $[n]$ by element additions/removals, and for $k=l$ this is the classical problem of generating all $\\binom{n}{k}$ subsets of $[n]$ by element exchanges. We prove the existence of such cyclic minimum-change enumerations for a large range of values $n$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08806","kind":"arxiv","version":6},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.08806","created_at":"2026-05-18T00:23:17.237438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08806v6","created_at":"2026-05-18T00:23:17.237438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08806","created_at":"2026-05-18T00:23:17.237438+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMAQR5WXZ5DB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMAQR5WXZ5DBNS4L","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMAQR5WX","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ","json":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ.json","graph_json":"https://pith.science/api/pith-number/DMAQR5WXZ5DBNS4LHII4JC5PTQ/graph.json","events_json":"https://pith.science/api/pith-number/DMAQR5WXZ5DBNS4LHII4JC5PTQ/events.json","paper":"https://pith.science/paper/DMAQR5WX"},"agent_actions":{"view_html":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ","download_json":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ.json","view_paper":"https://pith.science/paper/DMAQR5WX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08806&json=true","fetch_graph":"https://pith.science/api/pith-number/DMAQR5WXZ5DBNS4LHII4JC5PTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DMAQR5WXZ5DBNS4LHII4JC5PTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ/action/storage_attestation","attest_author":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ/action/author_attestation","sign_citation":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ/action/citation_signature","submit_replication":"https://pith.science/pith/DMAQR5WXZ5DBNS4LHII4JC5PTQ/action/replication_record"}},"created_at":"2026-05-18T00:23:17.237438+00:00","updated_at":"2026-05-18T00:23:17.237438+00:00"}