{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SBFP4HXXBQY77YTSYBNGNDY7JB","short_pith_number":"pith:SBFP4HXX","schema_version":"1.0","canonical_sha256":"904afe1ef70c31ffe272c05a668f1f486f7f40c3497c6f05ba6b289369be2b1b","source":{"kind":"arxiv","id":"1702.03018","version":2},"attestation_state":"computed","paper":{"title":"Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Andries E. Brouwer, J. Daniel Christensen","submitted_at":"2017-02-09T23:48:27Z","abstract_excerpt":"We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Chomp on a hypercube) and computing the number of linear extensions of the lattice of a 7-cube and related lattices."},"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":"1702.03018","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-09T23:48:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"00f494ac5e425d0953a9765bbf241e387b8909cf482e7a5184d88c984312418b","abstract_canon_sha256":"e5284a88aac81ad4e2bb5a7c01fdf3f4f16fe755b663a63c4a0b7404339914fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:40.453616Z","signature_b64":"Ia8uDxKgknAFMV1rHeVa2bM5vJS1USRIPo0iFMZARPSYP8O6SW7BA9TTpRse7021wjkbwmp3svXTDdBU53OhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"904afe1ef70c31ffe272c05a668f1f486f7f40c3497c6f05ba6b289369be2b1b","last_reissued_at":"2026-05-18T00:40:40.452561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:40.452561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterexamples to conjectures about Subset Takeaway and counting linear extensions of a Boolean lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Andries E. Brouwer, J. Daniel Christensen","submitted_at":"2017-02-09T23:48:27Z","abstract_excerpt":"We develop an algorithm for efficiently computing recursively defined functions on posets. We illustrate this algorithm by disproving conjectures about the game Subset Takeaway (Chomp on a hypercube) and computing the number of linear extensions of the lattice of a 7-cube and related lattices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.03018","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.03018","created_at":"2026-05-18T00:40:40.452955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.03018v2","created_at":"2026-05-18T00:40:40.452955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.03018","created_at":"2026-05-18T00:40:40.452955+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBFP4HXXBQY7","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBFP4HXXBQY77YTS","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBFP4HXX","created_at":"2026-05-18T12:31:43.269735+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/SBFP4HXXBQY77YTSYBNGNDY7JB","json":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB.json","graph_json":"https://pith.science/api/pith-number/SBFP4HXXBQY77YTSYBNGNDY7JB/graph.json","events_json":"https://pith.science/api/pith-number/SBFP4HXXBQY77YTSYBNGNDY7JB/events.json","paper":"https://pith.science/paper/SBFP4HXX"},"agent_actions":{"view_html":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB","download_json":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB.json","view_paper":"https://pith.science/paper/SBFP4HXX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.03018&json=true","fetch_graph":"https://pith.science/api/pith-number/SBFP4HXXBQY77YTSYBNGNDY7JB/graph.json","fetch_events":"https://pith.science/api/pith-number/SBFP4HXXBQY77YTSYBNGNDY7JB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB/action/storage_attestation","attest_author":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB/action/author_attestation","sign_citation":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB/action/citation_signature","submit_replication":"https://pith.science/pith/SBFP4HXXBQY77YTSYBNGNDY7JB/action/replication_record"}},"created_at":"2026-05-18T00:40:40.452955+00:00","updated_at":"2026-05-18T00:40:40.452955+00:00"}