{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A3QMI5EO3EQDOPEYYI4ELJL2PM","short_pith_number":"pith:A3QMI5EO","schema_version":"1.0","canonical_sha256":"06e0c4748ed920373c98c23845a57a7b0bbb2b9d1b8d068195ca85ecf8955c6b","source":{"kind":"arxiv","id":"1306.4850","version":2},"attestation_state":"computed","paper":{"title":"Linear programming duality for geometers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Gergely Ambrus","submitted_at":"2013-06-20T12:34:29Z","abstract_excerpt":"We present a geometric proof for the duality theorem of linear programming. Besides being self-contained and simple, the present approach also provides a transparent way for understanding this fundamental result."},"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":"1306.4850","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-06-20T12:34:29Z","cross_cats_sorted":[],"title_canon_sha256":"86cc83a6135f7d068fc5a7950b320963b3440ef1d118118be08c91077e075872","abstract_canon_sha256":"d74257f13d4ff65962d396b1c3f2bb37b633ab2d65291af3abea179e5fe80210"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:59.365421Z","signature_b64":"h3oQ/QelozXyeZx6zM9t1ZrWaLxVOPbLUml0DjqwHALUdw/O7xs02uqYrkpwzDYPVpMGZYi7G+A8LDTAAVByAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e0c4748ed920373c98c23845a57a7b0bbb2b9d1b8d068195ca85ecf8955c6b","last_reissued_at":"2026-05-18T03:04:59.364850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:59.364850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear programming duality for geometers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Gergely Ambrus","submitted_at":"2013-06-20T12:34:29Z","abstract_excerpt":"We present a geometric proof for the duality theorem of linear programming. Besides being self-contained and simple, the present approach also provides a transparent way for understanding this fundamental result."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.4850","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.4850","created_at":"2026-05-18T03:04:59.364945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.4850v2","created_at":"2026-05-18T03:04:59.364945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.4850","created_at":"2026-05-18T03:04:59.364945+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3QMI5EO3EQD","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3QMI5EO3EQDOPEY","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3QMI5EO","created_at":"2026-05-18T12:27:38.830355+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/A3QMI5EO3EQDOPEYYI4ELJL2PM","json":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM.json","graph_json":"https://pith.science/api/pith-number/A3QMI5EO3EQDOPEYYI4ELJL2PM/graph.json","events_json":"https://pith.science/api/pith-number/A3QMI5EO3EQDOPEYYI4ELJL2PM/events.json","paper":"https://pith.science/paper/A3QMI5EO"},"agent_actions":{"view_html":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM","download_json":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM.json","view_paper":"https://pith.science/paper/A3QMI5EO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.4850&json=true","fetch_graph":"https://pith.science/api/pith-number/A3QMI5EO3EQDOPEYYI4ELJL2PM/graph.json","fetch_events":"https://pith.science/api/pith-number/A3QMI5EO3EQDOPEYYI4ELJL2PM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM/action/storage_attestation","attest_author":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM/action/author_attestation","sign_citation":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM/action/citation_signature","submit_replication":"https://pith.science/pith/A3QMI5EO3EQDOPEYYI4ELJL2PM/action/replication_record"}},"created_at":"2026-05-18T03:04:59.364945+00:00","updated_at":"2026-05-18T03:04:59.364945+00:00"}