{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RCGLXSQZAWNS6OKNV6VIYSD6P3","short_pith_number":"pith:RCGLXSQZ","schema_version":"1.0","canonical_sha256":"888cbbca19059b2f394dafaa8c487e7ee2738ceae5978b9e3f5318f5a443ff97","source":{"kind":"arxiv","id":"1609.03137","version":3},"attestation_state":"computed","paper":{"title":"On a general framework for network representability in discrete optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yuni Iwamasa","submitted_at":"2016-09-11T09:06:57Z","abstract_excerpt":"In discrete optimization, representing an objective function as an $s$-$t$ cut function of a network is a basic technique to design an efficient minimization algorithm. A network representable function can be minimized by computing a minimum $s$-$t$ cut of a directed network, which is a very easy and fastly solved problem. Hence it is natural to ask what functions are network representable. In the case of pseudo Boolean functions (functions on $\\{0,1\\}^n$), it is known that any submodular function on $\\{0,1\\}^3$ is network representable. \\v{Z}ivn\\'y--Cohen--Jeavons showed by using the theory o"},"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":"1609.03137","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-11T09:06:57Z","cross_cats_sorted":[],"title_canon_sha256":"823cb16d7c04b96f966353ec33a6cb91922376335337a4ec744f2ee5c39f4b20","abstract_canon_sha256":"92328234e27e4ddc2668b4d3bfb1a44c0cf87c2aac3be24ae4bca6f2f25acd49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:35.619108Z","signature_b64":"gHeuS+RKI802lT0VK41ZcmRGvf6w8GFlXCJby5Tak/Nh3ro2QERGRTBlCgkFjZQC7rUZmhsth8fR60/jtZQIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"888cbbca19059b2f394dafaa8c487e7ee2738ceae5978b9e3f5318f5a443ff97","last_reissued_at":"2026-05-18T00:43:35.618647Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:35.618647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a general framework for network representability in discrete optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yuni Iwamasa","submitted_at":"2016-09-11T09:06:57Z","abstract_excerpt":"In discrete optimization, representing an objective function as an $s$-$t$ cut function of a network is a basic technique to design an efficient minimization algorithm. A network representable function can be minimized by computing a minimum $s$-$t$ cut of a directed network, which is a very easy and fastly solved problem. Hence it is natural to ask what functions are network representable. In the case of pseudo Boolean functions (functions on $\\{0,1\\}^n$), it is known that any submodular function on $\\{0,1\\}^3$ is network representable. \\v{Z}ivn\\'y--Cohen--Jeavons showed by using the theory o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03137","kind":"arxiv","version":3},"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":"1609.03137","created_at":"2026-05-18T00:43:35.618719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03137v3","created_at":"2026-05-18T00:43:35.618719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03137","created_at":"2026-05-18T00:43:35.618719+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCGLXSQZAWNS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCGLXSQZAWNS6OKN","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCGLXSQZ","created_at":"2026-05-18T12:30:41.710351+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/RCGLXSQZAWNS6OKNV6VIYSD6P3","json":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3.json","graph_json":"https://pith.science/api/pith-number/RCGLXSQZAWNS6OKNV6VIYSD6P3/graph.json","events_json":"https://pith.science/api/pith-number/RCGLXSQZAWNS6OKNV6VIYSD6P3/events.json","paper":"https://pith.science/paper/RCGLXSQZ"},"agent_actions":{"view_html":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3","download_json":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3.json","view_paper":"https://pith.science/paper/RCGLXSQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03137&json=true","fetch_graph":"https://pith.science/api/pith-number/RCGLXSQZAWNS6OKNV6VIYSD6P3/graph.json","fetch_events":"https://pith.science/api/pith-number/RCGLXSQZAWNS6OKNV6VIYSD6P3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3/action/storage_attestation","attest_author":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3/action/author_attestation","sign_citation":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3/action/citation_signature","submit_replication":"https://pith.science/pith/RCGLXSQZAWNS6OKNV6VIYSD6P3/action/replication_record"}},"created_at":"2026-05-18T00:43:35.618719+00:00","updated_at":"2026-05-18T00:43:35.618719+00:00"}