{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5JD2L3JPHF6B5FVC3NZ33QMEC4","short_pith_number":"pith:5JD2L3JP","canonical_record":{"source":{"id":"1303.3527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-12T11:19:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b0489ba2d7192751e15b1785da26768f8409b3bb057e1631223a9968a19b0aeb","abstract_canon_sha256":"f8360103557a10cbf0ebab1091d0408885b0028c9bc75e2c80ea86d1b3d5c812"},"schema_version":"1.0"},"canonical_sha256":"ea47a5ed2f397c1e96a2db73bdc1841716e6ec0c9fc18dae3b9235dd18dea864","source":{"kind":"arxiv","id":"1303.3527","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3527","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3527v1","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3527","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"5JD2L3JPHF6B","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5JD2L3JPHF6B5FVC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5JD2L3JP","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5JD2L3JPHF6B5FVC3NZ33QMEC4","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3527","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-12T11:19:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b0489ba2d7192751e15b1785da26768f8409b3bb057e1631223a9968a19b0aeb","abstract_canon_sha256":"f8360103557a10cbf0ebab1091d0408885b0028c9bc75e2c80ea86d1b3d5c812"},"schema_version":"1.0"},"canonical_sha256":"ea47a5ed2f397c1e96a2db73bdc1841716e6ec0c9fc18dae3b9235dd18dea864","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:54.349119Z","signature_b64":"do7LZqendVSZPjapPWZYy1VwEctdt51mRxh7yXkCH2WHFlvazo3Eh8SKYuwq/HEygrDNsV391V8nahcx7q0sDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea47a5ed2f397c1e96a2db73bdc1841716e6ec0c9fc18dae3b9235dd18dea864","last_reissued_at":"2026-05-18T03:30:54.348217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:54.348217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3527","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-05-18T03:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W58Zi00Xxm3yUMLWxV9hPTzQDcmR6fKZRoj8G2MNye8Qd4pnLN/QOBdjwyQJLyxsc2VYaQCANmxNMY4iufjsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:01:41.219341Z"},"content_sha256":"31726a8e80fcd46e67a8c1d38023fa3628daa1d1724069be35e53619078392c5","schema_version":"1.0","event_id":"sha256:31726a8e80fcd46e67a8c1d38023fa3628daa1d1724069be35e53619078392c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5JD2L3JPHF6B5FVC3NZ33QMEC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classification of Boolean Functions where Affine Functions are Uniformly Distributed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Pabitra Pal Choudhury, Ranjeet Kumar Rout, Sudhakar Sahoo","submitted_at":"2013-03-12T11:19:18Z","abstract_excerpt":"Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where only one affine Boolean function belongs to each class. Two different methods are proposed to achieve this classification. The first method is a recursive procedure that uses the Cartesian product of sets starting from the set of 1-variable Boolean function and in the second method classification is achieved through a set of invariant bit positions with respect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3527","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"},"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-05-18T03:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohZfstclDpIeU0Tz6ak9i33VcTT0+je5hFbDbTqhJe2Et2/+GSMJnNPzOi21uaiBf+yYaYxZ1w0mjiH9ahTtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T21:01:41.219694Z"},"content_sha256":"e252277d55e78b8e231515da5d4536e39ed84e37e43290ded7f51465e98011fd","schema_version":"1.0","event_id":"sha256:e252277d55e78b8e231515da5d4536e39ed84e37e43290ded7f51465e98011fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4/bundle.json","state_url":"https://pith.science/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4/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-06-24T21:01:41Z","links":{"resolver":"https://pith.science/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4","bundle":"https://pith.science/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4/bundle.json","state":"https://pith.science/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JD2L3JPHF6B5FVC3NZ33QMEC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5JD2L3JPHF6B5FVC3NZ33QMEC4","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":"f8360103557a10cbf0ebab1091d0408885b0028c9bc75e2c80ea86d1b3d5c812","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-12T11:19:18Z","title_canon_sha256":"b0489ba2d7192751e15b1785da26768f8409b3bb057e1631223a9968a19b0aeb"},"schema_version":"1.0","source":{"id":"1303.3527","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3527","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3527v1","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3527","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"5JD2L3JPHF6B","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5JD2L3JPHF6B5FVC","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5JD2L3JP","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:e252277d55e78b8e231515da5d4536e39ed84e37e43290ded7f51465e98011fd","target":"graph","created_at":"2026-05-18T03:30:54Z","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"},"paper":{"abstract_excerpt":"Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where only one affine Boolean function belongs to each class. Two different methods are proposed to achieve this classification. The first method is a recursive procedure that uses the Cartesian product of sets starting from the set of 1-variable Boolean function and in the second method classification is achieved through a set of invariant bit positions with respect","authors_text":"Pabitra Pal Choudhury, Ranjeet Kumar Rout, Sudhakar Sahoo","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-12T11:19:18Z","title":"Classification of Boolean Functions where Affine Functions are Uniformly Distributed"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3527","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:31726a8e80fcd46e67a8c1d38023fa3628daa1d1724069be35e53619078392c5","target":"record","created_at":"2026-05-18T03:30:54Z","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":"f8360103557a10cbf0ebab1091d0408885b0028c9bc75e2c80ea86d1b3d5c812","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-03-12T11:19:18Z","title_canon_sha256":"b0489ba2d7192751e15b1785da26768f8409b3bb057e1631223a9968a19b0aeb"},"schema_version":"1.0","source":{"id":"1303.3527","kind":"arxiv","version":1}},"canonical_sha256":"ea47a5ed2f397c1e96a2db73bdc1841716e6ec0c9fc18dae3b9235dd18dea864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea47a5ed2f397c1e96a2db73bdc1841716e6ec0c9fc18dae3b9235dd18dea864","first_computed_at":"2026-05-18T03:30:54.348217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:54.348217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"do7LZqendVSZPjapPWZYy1VwEctdt51mRxh7yXkCH2WHFlvazo3Eh8SKYuwq/HEygrDNsV391V8nahcx7q0sDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:54.349119Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3527","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:31726a8e80fcd46e67a8c1d38023fa3628daa1d1724069be35e53619078392c5","sha256:e252277d55e78b8e231515da5d4536e39ed84e37e43290ded7f51465e98011fd"],"state_sha256":"04173ac2194a0665de967b96128e038ce7dea0856adfb74cbd164698aa0c36f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjR36mtqFfyfPnKXGMXmgnjVnveVxaRi55UgsRzQBBGyKKL+ZHWg41TZylLqJBS7O0Sa6+MF/fm7jJfHcKb0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T21:01:41.221664Z","bundle_sha256":"b20b3c0634e44ab881c827ab8df4ff82336cb866359cb24a078ac5f9fe4fb036"}}