{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IGMVFZPOKBHBYI2UVHXHRL6UNO","short_pith_number":"pith:IGMVFZPO","canonical_record":{"source":{"id":"1502.00357","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-02-02T04:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"717e97eb6c130b3c60ae031046a2211f864c46063a76ea653b250e2ee429f18f","abstract_canon_sha256":"f676300850c001e38118bcc16e9fb83cb9462a1db29eeab021bc71f3448f6147"},"schema_version":"1.0"},"canonical_sha256":"419952e5ee504e1c2354a9ee78afd46bba96494b7622c22d33b0c90039d14ea7","source":{"kind":"arxiv","id":"1502.00357","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00357","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00357v2","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00357","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"IGMVFZPOKBHB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IGMVFZPOKBHBYI2U","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IGMVFZPO","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IGMVFZPOKBHBYI2UVHXHRL6UNO","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00357","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-02-02T04:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"717e97eb6c130b3c60ae031046a2211f864c46063a76ea653b250e2ee429f18f","abstract_canon_sha256":"f676300850c001e38118bcc16e9fb83cb9462a1db29eeab021bc71f3448f6147"},"schema_version":"1.0"},"canonical_sha256":"419952e5ee504e1c2354a9ee78afd46bba96494b7622c22d33b0c90039d14ea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:58.217523Z","signature_b64":"RZ3359/eJY+KrmOCqcAZqu8WgGZ+FVkaSBRgYGapb7Ywmx1PkUF3d/obPF/5e2X8gN+zAnfZkbJKwhRiZDbdCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"419952e5ee504e1c2354a9ee78afd46bba96494b7622c22d33b0c90039d14ea7","last_reissued_at":"2026-05-18T02:27:58.216933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:58.216933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00357","source_version":2,"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-18T02:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31VSWx6wMMA6dFjyPTp3Vy6iFO64sLpLowtw5O0M7qChZ8nbgtvDxEfYPaHCJci7aFpLqmcotCgkAGbhhd9nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:38.102571Z"},"content_sha256":"64d93e68c8345e8b22deedfd20ab35214a70ad4c98ec2425a50c1686950814df","schema_version":"1.0","event_id":"sha256:64d93e68c8345e8b22deedfd20ab35214a70ad4c98ec2425a50c1686950814df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IGMVFZPOKBHBYI2UVHXHRL6UNO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chia-Jung Lee, Ming-Chuan Yang, Satya V. Lokam, Shi-Chun Tsai","submitted_at":"2015-02-02T04:45:21Z","abstract_excerpt":"Let $\\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\\in \\mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This existent result suggests a possible way to deal with general Boolean functions via its subfunctions of some restrictions.\n  As an application, we consider the degree lower bound of representing polynomials over finite rings. Let $f\\in \\mathcal{F}_{n}^*$ and denote the exact representing degree over the ring $\\mathbb{Z}_m$ (with the integer $m>2$) as $d_m(f)$. L"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00357","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"},"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-18T02:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5TjIWEVy/2Nqxu/+UHtfcNiPCOYzXUne1aDZjC7ivnQRqgS4AYDOzi2ZW7lWGgNDLqkNUi+vctvwM3mmWZpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:38.102956Z"},"content_sha256":"db7b1a5384444ded754c9b01030d835a217f5df7b5b104c53a6263bfba11178d","schema_version":"1.0","event_id":"sha256:db7b1a5384444ded754c9b01030d835a217f5df7b5b104c53a6263bfba11178d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO/bundle.json","state_url":"https://pith.science/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO/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-05-31T20:09:38Z","links":{"resolver":"https://pith.science/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO","bundle":"https://pith.science/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO/bundle.json","state":"https://pith.science/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGMVFZPOKBHBYI2UVHXHRL6UNO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IGMVFZPOKBHBYI2UVHXHRL6UNO","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":"f676300850c001e38118bcc16e9fb83cb9462a1db29eeab021bc71f3448f6147","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-02-02T04:45:21Z","title_canon_sha256":"717e97eb6c130b3c60ae031046a2211f864c46063a76ea653b250e2ee429f18f"},"schema_version":"1.0","source":{"id":"1502.00357","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00357","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00357v2","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00357","created_at":"2026-05-18T02:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"IGMVFZPOKBHB","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"IGMVFZPOKBHBYI2U","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"IGMVFZPO","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:db7b1a5384444ded754c9b01030d835a217f5df7b5b104c53a6263bfba11178d","target":"graph","created_at":"2026-05-18T02:27:58Z","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":"Let $\\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\\in \\mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This existent result suggests a possible way to deal with general Boolean functions via its subfunctions of some restrictions.\n  As an application, we consider the degree lower bound of representing polynomials over finite rings. Let $f\\in \\mathcal{F}_{n}^*$ and denote the exact representing degree over the ring $\\mathbb{Z}_m$ (with the integer $m>2$) as $d_m(f)$. L","authors_text":"Chia-Jung Lee, Ming-Chuan Yang, Satya V. Lokam, Shi-Chun Tsai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-02-02T04:45:21Z","title":"On Restricting No-Junta Boolean Function and Degree Lower Bounds by Polynomial Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00357","kind":"arxiv","version":2},"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:64d93e68c8345e8b22deedfd20ab35214a70ad4c98ec2425a50c1686950814df","target":"record","created_at":"2026-05-18T02:27:58Z","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":"f676300850c001e38118bcc16e9fb83cb9462a1db29eeab021bc71f3448f6147","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.CC","submitted_at":"2015-02-02T04:45:21Z","title_canon_sha256":"717e97eb6c130b3c60ae031046a2211f864c46063a76ea653b250e2ee429f18f"},"schema_version":"1.0","source":{"id":"1502.00357","kind":"arxiv","version":2}},"canonical_sha256":"419952e5ee504e1c2354a9ee78afd46bba96494b7622c22d33b0c90039d14ea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"419952e5ee504e1c2354a9ee78afd46bba96494b7622c22d33b0c90039d14ea7","first_computed_at":"2026-05-18T02:27:58.216933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:58.216933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RZ3359/eJY+KrmOCqcAZqu8WgGZ+FVkaSBRgYGapb7Ywmx1PkUF3d/obPF/5e2X8gN+zAnfZkbJKwhRiZDbdCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:58.217523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00357","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64d93e68c8345e8b22deedfd20ab35214a70ad4c98ec2425a50c1686950814df","sha256:db7b1a5384444ded754c9b01030d835a217f5df7b5b104c53a6263bfba11178d"],"state_sha256":"142815c133ecb5d7aa67a747a0ef46d2510fba387782f8aee178c53e6518d119"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S8xJl7PZuY9z3BMheumNHUO62UiAgIksGaDdZr1d8D/sEVnVBwg7mbHnmicOQI0UDJny+ON4kf9bh++g0tfQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:38.105381Z","bundle_sha256":"23ab7e90dc82fd6483ddea7287ff4070f7b7c35b4758adfde119fc81e8300349"}}