{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KOLOIRVAUJ4ST63QMDSKNSDHIB","short_pith_number":"pith:KOLOIRVA","schema_version":"1.0","canonical_sha256":"5396e446a0a27929fb7060e4a6c86740616f311f86e0bc5638d85058321da4f0","source":{"kind":"arxiv","id":"1310.7797","version":1},"attestation_state":"computed","paper":{"title":"Set-reconstructibility of Post classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Erkko Lehtonen, Karsten Sch\\\"olzel, Miguel Couceiro","submitted_at":"2013-10-29T13:19:16Z","abstract_excerpt":"The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaing clones are not weakly reconstructible."},"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":"1310.7797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-29T13:19:16Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"541f7de3b28275b4e33fba3ee982358119fb04232f609a7af96f163248f5ee9d","abstract_canon_sha256":"947ff7ca53220d63802deb0b8828b4b97f3e84c8f5e9a1f0719bc768f2bca433"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:38.618170Z","signature_b64":"Tl8uwfmkyDDWHjVcEUrd7ue5U1ZctyKJfrFyySCQYISmkNiGPEIbo++GY3cGHGOMCuLLb8V5q4H0QMSUgmj1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5396e446a0a27929fb7060e4a6c86740616f311f86e0bc5638d85058321da4f0","last_reissued_at":"2026-05-18T00:57:38.617498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:38.617498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set-reconstructibility of Post classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.CO","authors_text":"Erkko Lehtonen, Karsten Sch\\\"olzel, Miguel Couceiro","submitted_at":"2013-10-29T13:19:16Z","abstract_excerpt":"The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas the remaing clones are not weakly reconstructible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.7797","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":""},"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":"1310.7797","created_at":"2026-05-18T00:57:38.617603+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.7797v1","created_at":"2026-05-18T00:57:38.617603+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.7797","created_at":"2026-05-18T00:57:38.617603+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOLOIRVAUJ4S","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOLOIRVAUJ4ST63Q","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOLOIRVA","created_at":"2026-05-18T12:27:51.066281+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/KOLOIRVAUJ4ST63QMDSKNSDHIB","json":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB.json","graph_json":"https://pith.science/api/pith-number/KOLOIRVAUJ4ST63QMDSKNSDHIB/graph.json","events_json":"https://pith.science/api/pith-number/KOLOIRVAUJ4ST63QMDSKNSDHIB/events.json","paper":"https://pith.science/paper/KOLOIRVA"},"agent_actions":{"view_html":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB","download_json":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB.json","view_paper":"https://pith.science/paper/KOLOIRVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.7797&json=true","fetch_graph":"https://pith.science/api/pith-number/KOLOIRVAUJ4ST63QMDSKNSDHIB/graph.json","fetch_events":"https://pith.science/api/pith-number/KOLOIRVAUJ4ST63QMDSKNSDHIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB/action/storage_attestation","attest_author":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB/action/author_attestation","sign_citation":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB/action/citation_signature","submit_replication":"https://pith.science/pith/KOLOIRVAUJ4ST63QMDSKNSDHIB/action/replication_record"}},"created_at":"2026-05-18T00:57:38.617603+00:00","updated_at":"2026-05-18T00:57:38.617603+00:00"}