{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XEG26RPOOKQ4AZSJXIUUXAVXYO","short_pith_number":"pith:XEG26RPO","schema_version":"1.0","canonical_sha256":"b90daf45ee72a1c06649ba294b82b7c3884afcc54d9377e3c589885d4aaf67f9","source":{"kind":"arxiv","id":"1012.5130","version":1},"attestation_state":"computed","paper":{"title":"A Relation between the Protocol Partition Number and the Quasi-Additive Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Naoyuki Kamiyama","submitted_at":"2010-12-23T01:57:18Z","abstract_excerpt":"In this note, we show that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno [MFCS'10] is equivalent to the dual problem of the linear programming relaxation of an integer programming for computing the protocol partition number. Together with the result of Ueno [MFCS'10], our results imply that there exists no gap between our integer programming for computing the protocol partition number and its linear programming relaxation."},"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":"1012.5130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-23T01:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"b76494f6f5812648c594b23cc9bec9a05fdf50ba48546889241f0ab194e682dd","abstract_canon_sha256":"9ec0fbeb301bc908573cd0522499b85d9fc19810c3b83ff9b3d82ff73e9ed1b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:35.750911Z","signature_b64":"6dED2PsuCpTDyMGEfBHdpuxfehPd+484GuFAYCZGryzCwp/tuazhnvmhShWEmx1/nFOiXp5OAC8jwgA595j5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b90daf45ee72a1c06649ba294b82b7c3884afcc54d9377e3c589885d4aaf67f9","last_reissued_at":"2026-05-18T04:32:35.750496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:35.750496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Relation between the Protocol Partition Number and the Quasi-Additive Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Naoyuki Kamiyama","submitted_at":"2010-12-23T01:57:18Z","abstract_excerpt":"In this note, we show that the linear programming for computing the quasi-additive bound of the formula size of a Boolean function presented by Ueno [MFCS'10] is equivalent to the dual problem of the linear programming relaxation of an integer programming for computing the protocol partition number. Together with the result of Ueno [MFCS'10], our results imply that there exists no gap between our integer programming for computing the protocol partition number and its linear programming relaxation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5130","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":"1012.5130","created_at":"2026-05-18T04:32:35.750561+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.5130v1","created_at":"2026-05-18T04:32:35.750561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5130","created_at":"2026-05-18T04:32:35.750561+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEG26RPOOKQ4","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEG26RPOOKQ4AZSJ","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEG26RPO","created_at":"2026-05-18T12:26:17.028572+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/XEG26RPOOKQ4AZSJXIUUXAVXYO","json":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO.json","graph_json":"https://pith.science/api/pith-number/XEG26RPOOKQ4AZSJXIUUXAVXYO/graph.json","events_json":"https://pith.science/api/pith-number/XEG26RPOOKQ4AZSJXIUUXAVXYO/events.json","paper":"https://pith.science/paper/XEG26RPO"},"agent_actions":{"view_html":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO","download_json":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO.json","view_paper":"https://pith.science/paper/XEG26RPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.5130&json=true","fetch_graph":"https://pith.science/api/pith-number/XEG26RPOOKQ4AZSJXIUUXAVXYO/graph.json","fetch_events":"https://pith.science/api/pith-number/XEG26RPOOKQ4AZSJXIUUXAVXYO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO/action/storage_attestation","attest_author":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO/action/author_attestation","sign_citation":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO/action/citation_signature","submit_replication":"https://pith.science/pith/XEG26RPOOKQ4AZSJXIUUXAVXYO/action/replication_record"}},"created_at":"2026-05-18T04:32:35.750561+00:00","updated_at":"2026-05-18T04:32:35.750561+00:00"}