{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZIL4HWS3N52ISNA3T7DRNBTKF3","short_pith_number":"pith:ZIL4HWS3","schema_version":"1.0","canonical_sha256":"ca17c3da5b6f7489341b9fc716866a2edad4168b2a8b83647db978cfcb8a5919","source":{"kind":"arxiv","id":"1803.05257","version":3},"attestation_state":"computed","paper":{"title":"Lov\\'asz extension and graph cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.SP"],"primary_cat":"math.CO","authors_text":"Dong Zhang, Kung-Ching Chang, Sihong Shao, Weixi Zhang","submitted_at":"2018-03-14T13:20:01Z","abstract_excerpt":"A set-pair Lov\\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems."},"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":"1803.05257","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-14T13:20:01Z","cross_cats_sorted":["math.OC","math.SP"],"title_canon_sha256":"5456a40c60eb8fdee4d47af6be937b49a7476c9d5627fd1786b803a02805baca","abstract_canon_sha256":"eb201e5c62162cd87ab9212ae2a51d1ec541191fff3d914afa77642a9b867170"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:37:54.073150Z","signature_b64":"3wWASDejU7baFmhmf/KQGBP4G8/20lTyGZBY5Aaz0n49dppfaE0jCRJTvf3efOrdTHko+eqEkm7CKx/19esYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca17c3da5b6f7489341b9fc716866a2edad4168b2a8b83647db978cfcb8a5919","last_reissued_at":"2026-07-05T02:37:54.072720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:37:54.072720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lov\\'asz extension and graph cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.SP"],"primary_cat":"math.CO","authors_text":"Dong Zhang, Kung-Ching Chang, Sihong Shao, Weixi Zhang","submitted_at":"2018-03-14T13:20:01Z","abstract_excerpt":"A set-pair Lov\\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05257","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1803.05257/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1803.05257","created_at":"2026-07-05T02:37:54.072787+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05257v3","created_at":"2026-07-05T02:37:54.072787+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05257","created_at":"2026-07-05T02:37:54.072787+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIL4HWS3N52I","created_at":"2026-07-05T02:37:54.072787+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIL4HWS3N52ISNA3","created_at":"2026-07-05T02:37:54.072787+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIL4HWS3","created_at":"2026-07-05T02:37:54.072787+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/ZIL4HWS3N52ISNA3T7DRNBTKF3","json":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3.json","graph_json":"https://pith.science/api/pith-number/ZIL4HWS3N52ISNA3T7DRNBTKF3/graph.json","events_json":"https://pith.science/api/pith-number/ZIL4HWS3N52ISNA3T7DRNBTKF3/events.json","paper":"https://pith.science/paper/ZIL4HWS3"},"agent_actions":{"view_html":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3","download_json":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3.json","view_paper":"https://pith.science/paper/ZIL4HWS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05257&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIL4HWS3N52ISNA3T7DRNBTKF3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIL4HWS3N52ISNA3T7DRNBTKF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3/action/storage_attestation","attest_author":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3/action/author_attestation","sign_citation":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3/action/citation_signature","submit_replication":"https://pith.science/pith/ZIL4HWS3N52ISNA3T7DRNBTKF3/action/replication_record"}},"created_at":"2026-07-05T02:37:54.072787+00:00","updated_at":"2026-07-05T02:37:54.072787+00:00"}