{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NNRLT2GP2JGA7XJXZY7SZWGX77","short_pith_number":"pith:NNRLT2GP","schema_version":"1.0","canonical_sha256":"6b62b9e8cfd24c0fdd37ce3f2cd8d7ffdfb00945467eaec7c5d4d937d3dd3ff2","source":{"kind":"arxiv","id":"1807.04186","version":1},"attestation_state":"computed","paper":{"title":"A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Assaf Kfoury","submitted_at":"2018-07-11T15:16:25Z","abstract_excerpt":"We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas."},"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":"1807.04186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-11T15:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"9d2c401fb9770d2eeea7b927fe0508b8ca7b2785a63ab4a0dc6f0d6e8e2ee54d","abstract_canon_sha256":"9f671f990430a2a1da08c5a229d342fe94669a2d309e563bdd61e6a21bfe42a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:57.653114Z","signature_b64":"YD7nuZ/yIXgkmsjE86qa95V9uERTY7fGsP8x2jYRzd4iM825EY+8xYb+aBmRUEbg+cYr3SKkIlkLnb5fxuyEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b62b9e8cfd24c0fdd37ce3f2cd8d7ffdfb00945467eaec7c5d4d937d3dd3ff2","last_reissued_at":"2026-05-18T00:10:57.652356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:57.652356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Assaf Kfoury","submitted_at":"2018-07-11T15:16:25Z","abstract_excerpt":"We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04186","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":"1807.04186","created_at":"2026-05-18T00:10:57.652485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04186v1","created_at":"2026-05-18T00:10:57.652485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04186","created_at":"2026-05-18T00:10:57.652485+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNRLT2GP2JGA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNRLT2GP2JGA7XJX","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNRLT2GP","created_at":"2026-05-18T12:32:40.477152+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/NNRLT2GP2JGA7XJXZY7SZWGX77","json":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77.json","graph_json":"https://pith.science/api/pith-number/NNRLT2GP2JGA7XJXZY7SZWGX77/graph.json","events_json":"https://pith.science/api/pith-number/NNRLT2GP2JGA7XJXZY7SZWGX77/events.json","paper":"https://pith.science/paper/NNRLT2GP"},"agent_actions":{"view_html":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77","download_json":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77.json","view_paper":"https://pith.science/paper/NNRLT2GP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04186&json=true","fetch_graph":"https://pith.science/api/pith-number/NNRLT2GP2JGA7XJXZY7SZWGX77/graph.json","fetch_events":"https://pith.science/api/pith-number/NNRLT2GP2JGA7XJXZY7SZWGX77/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77/action/storage_attestation","attest_author":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77/action/author_attestation","sign_citation":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77/action/citation_signature","submit_replication":"https://pith.science/pith/NNRLT2GP2JGA7XJXZY7SZWGX77/action/replication_record"}},"created_at":"2026-05-18T00:10:57.652485+00:00","updated_at":"2026-05-18T00:10:57.652485+00:00"}