{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SL4GTOTRE5DYYHL3LD6V26WA7R","short_pith_number":"pith:SL4GTOTR","schema_version":"1.0","canonical_sha256":"92f869ba7127478c1d7b58fd5d7ac0fc59ca8f198084c0ffa324311c7bae1233","source":{"kind":"arxiv","id":"2410.00315","version":1},"attestation_state":"computed","paper":{"title":"Lattice-Valued Bottleneck Duality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Julian Gould, Miguel Lopez, Robert Ghrist","submitted_at":"2024-10-01T01:26:54Z","abstract_excerpt":"This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive lattice. For posets, we generalize a bottleneck version of Dilworth's theorem, again weighted in a distributive lattice. These results are applicable to a wide array of non-numerical network flow problems, as shown. All results, proofs, and applications were created in collaboration with AI language models. An appendix documents their role and impact."},"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":"2410.00315","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-10-01T01:26:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f53b29f12f34c3d3767af1aedc37f7a78d92f6aaef56801afa6209eb24bfa07b","abstract_canon_sha256":"eaa9b18ae894cc83d8fc667ad6936cac1580ab5efb3662733383bd5644bcc1ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:14:03.025747Z","signature_b64":"IFeyGMUAIVLBTwzJDSFM6p+MqAqZwjtgrooEK5yoTNSrhU3Vz25dLCV8CZtrnHmujcw7FB32Vma+CWLOAZ5pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92f869ba7127478c1d7b58fd5d7ac0fc59ca8f198084c0ffa324311c7bae1233","last_reissued_at":"2026-07-05T09:14:03.025307Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:14:03.025307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lattice-Valued Bottleneck Duality","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Julian Gould, Miguel Lopez, Robert Ghrist","submitted_at":"2024-10-01T01:26:54Z","abstract_excerpt":"This note reformulates certain classical combinatorial duality theorems in the context of order lattices. For source-target networks, we generalize bottleneck path-cut and flow-cut duality results to edges with capacities in a distributive lattice. For posets, we generalize a bottleneck version of Dilworth's theorem, again weighted in a distributive lattice. These results are applicable to a wide array of non-numerical network flow problems, as shown. All results, proofs, and applications were created in collaboration with AI language models. An appendix documents their role and impact."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.00315","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.00315/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":"2410.00315","created_at":"2026-07-05T09:14:03.025372+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.00315v1","created_at":"2026-07-05T09:14:03.025372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.00315","created_at":"2026-07-05T09:14:03.025372+00:00"},{"alias_kind":"pith_short_12","alias_value":"SL4GTOTRE5DY","created_at":"2026-07-05T09:14:03.025372+00:00"},{"alias_kind":"pith_short_16","alias_value":"SL4GTOTRE5DYYHL3","created_at":"2026-07-05T09:14:03.025372+00:00"},{"alias_kind":"pith_short_8","alias_value":"SL4GTOTR","created_at":"2026-07-05T09:14:03.025372+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10379","citing_title":"Not All Proofs Are Equal: Evaluating LLM Proof Quality Beyond Correctness","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10379","citing_title":"Not All Proofs Are Equal: Evaluating LLM Proof Quality Beyond Correctness","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06107","citing_title":"Artificial Intelligence and the Structure of Mathematics","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R","json":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R.json","graph_json":"https://pith.science/api/pith-number/SL4GTOTRE5DYYHL3LD6V26WA7R/graph.json","events_json":"https://pith.science/api/pith-number/SL4GTOTRE5DYYHL3LD6V26WA7R/events.json","paper":"https://pith.science/paper/SL4GTOTR"},"agent_actions":{"view_html":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R","download_json":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R.json","view_paper":"https://pith.science/paper/SL4GTOTR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.00315&json=true","fetch_graph":"https://pith.science/api/pith-number/SL4GTOTRE5DYYHL3LD6V26WA7R/graph.json","fetch_events":"https://pith.science/api/pith-number/SL4GTOTRE5DYYHL3LD6V26WA7R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R/action/storage_attestation","attest_author":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R/action/author_attestation","sign_citation":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R/action/citation_signature","submit_replication":"https://pith.science/pith/SL4GTOTRE5DYYHL3LD6V26WA7R/action/replication_record"}},"created_at":"2026-07-05T09:14:03.025372+00:00","updated_at":"2026-07-05T09:14:03.025372+00:00"}