{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BCGOECJTYPRYXX5F2ISGVHNR43","short_pith_number":"pith:BCGOECJT","schema_version":"1.0","canonical_sha256":"088ce20933c3e38bdfa5d2246a9db1e6d6eab36c6dc8c6761a096eefbf88fff3","source":{"kind":"arxiv","id":"2402.18537","version":2},"attestation_state":"computed","paper":{"title":"On the enumeration of signatures of XOR-CNF's","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fr\\'ed\\'eric Olive, Nadia Creignou, Oscar Defrain, Simon Vilmin","submitted_at":"2024-02-28T18:22:03Z","abstract_excerpt":"Given a CNF formula $\\varphi$ with clauses $C_1, \\dots, C_m$ over a set of variables $V$, a truth assignment $\\mathbf{a} : V \\to \\{0, 1\\}$ generates a binary sequence $\\sigma_\\varphi(\\mathbf{a})=(C_1(\\mathbf{a}), \\ldots, C_m(\\mathbf{a}))$, called a signature of $\\varphi$, where $C_i(\\mathbf{a})=1$ if clause $C_i$ evaluates to 1 under assignment $\\mathbf{a}$, and $C_i(\\mathbf{a})=0$ otherwise. Signatures and their associated generation problems have given rise to new yet promising research questions in algorithmic enumeration. In a recent paper, B\\'erczi et al. interestingly proved that generat"},"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":"2402.18537","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-28T18:22:03Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"4bd4d11d4337e696f03aca99185ac57ee5d69614249b7056ebac28c1a20baa37","abstract_canon_sha256":"84c1daf639e04828c837ae47fee3c76ebc6ba1a7921514fe45761de582ddef55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:47:56.233681Z","signature_b64":"8UkzShiclRDKDNlh+aQDwZS/HimIjtGI8hhX2pPvaJlbGk89wfInCQQXBiI2D0SfXkWYIy2UUzDOX7NrgY3UDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"088ce20933c3e38bdfa5d2246a9db1e6d6eab36c6dc8c6761a096eefbf88fff3","last_reissued_at":"2026-07-05T11:47:56.233205Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:47:56.233205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the enumeration of signatures of XOR-CNF's","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Fr\\'ed\\'eric Olive, Nadia Creignou, Oscar Defrain, Simon Vilmin","submitted_at":"2024-02-28T18:22:03Z","abstract_excerpt":"Given a CNF formula $\\varphi$ with clauses $C_1, \\dots, C_m$ over a set of variables $V$, a truth assignment $\\mathbf{a} : V \\to \\{0, 1\\}$ generates a binary sequence $\\sigma_\\varphi(\\mathbf{a})=(C_1(\\mathbf{a}), \\ldots, C_m(\\mathbf{a}))$, called a signature of $\\varphi$, where $C_i(\\mathbf{a})=1$ if clause $C_i$ evaluates to 1 under assignment $\\mathbf{a}$, and $C_i(\\mathbf{a})=0$ otherwise. Signatures and their associated generation problems have given rise to new yet promising research questions in algorithmic enumeration. In a recent paper, B\\'erczi et al. interestingly proved that generat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.18537","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.18537/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2402.18537","created_at":"2026-07-05T11:47:56.233257+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.18537v2","created_at":"2026-07-05T11:47:56.233257+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.18537","created_at":"2026-07-05T11:47:56.233257+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCGOECJTYPRY","created_at":"2026-07-05T11:47:56.233257+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCGOECJTYPRYXX5F","created_at":"2026-07-05T11:47:56.233257+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCGOECJT","created_at":"2026-07-05T11:47:56.233257+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.07528","citing_title":"On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43","json":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43.json","graph_json":"https://pith.science/api/pith-number/BCGOECJTYPRYXX5F2ISGVHNR43/graph.json","events_json":"https://pith.science/api/pith-number/BCGOECJTYPRYXX5F2ISGVHNR43/events.json","paper":"https://pith.science/paper/BCGOECJT"},"agent_actions":{"view_html":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43","download_json":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43.json","view_paper":"https://pith.science/paper/BCGOECJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.18537&json=true","fetch_graph":"https://pith.science/api/pith-number/BCGOECJTYPRYXX5F2ISGVHNR43/graph.json","fetch_events":"https://pith.science/api/pith-number/BCGOECJTYPRYXX5F2ISGVHNR43/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43/action/storage_attestation","attest_author":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43/action/author_attestation","sign_citation":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43/action/citation_signature","submit_replication":"https://pith.science/pith/BCGOECJTYPRYXX5F2ISGVHNR43/action/replication_record"}},"created_at":"2026-07-05T11:47:56.233257+00:00","updated_at":"2026-07-05T11:47:56.233257+00:00"}