{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3GWIC4AZVUUJILV5HHANM2KC4Z","short_pith_number":"pith:3GWIC4AZ","schema_version":"1.0","canonical_sha256":"d9ac817019ad28942ebd39c0d66942e65a0064b0865f16bdfa826c79405dd451","source":{"kind":"arxiv","id":"2608.07674","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Perfect Fair-Triangle Packing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brendan Mumey, Mingyang Gong, Zhi-Zhong Chen","submitted_at":"2026-08-07T18:01:30Z","abstract_excerpt":"In this paper, we study the {\\em perfect fair-triangle packing} problem (abbreviated as PFTP), which incorporates the fairness criterion from {\\em fair clustering} into the {\\em maximum-weight triangle packing} problem. Specifically, the input is an edge-weighted complete graph $G = (V, E)$ with $|V| = 3n$, where each vertex is colored red or blue. A {\\em fair triangle} is a triangle containing vertices of both colors. PFTP asks for a partition of $V$ into $n$ fair triangles such that the total edge weight is maximized. To the best of our knowledge, this is the first paper to study PFTP.\n  PFT"},"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":"2608.07674","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-07T18:01:30Z","cross_cats_sorted":[],"title_canon_sha256":"e993822fc7f22f5565d14dcf51b31d29e04f2a66d3e7003113fb19b47b63600e","abstract_canon_sha256":"64b5948fd9bd2c2f01453dc8bfd6f06246e30d17cad02143c49e279da6952bcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T00:15:40.375669Z","signature_b64":"N8PITEYWeFrJUv7q0Zm/fsrXBHLiHT2Xafxu1v8B2Xf67Vo2EV3ayANI2LTIfwxAYpQ1TbXCmNyljQ2MpendAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ac817019ad28942ebd39c0d66942e65a0064b0865f16bdfa826c79405dd451","last_reissued_at":"2026-08-11T00:15:40.373503Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T00:15:40.373503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Perfect Fair-Triangle Packing","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Brendan Mumey, Mingyang Gong, Zhi-Zhong Chen","submitted_at":"2026-08-07T18:01:30Z","abstract_excerpt":"In this paper, we study the {\\em perfect fair-triangle packing} problem (abbreviated as PFTP), which incorporates the fairness criterion from {\\em fair clustering} into the {\\em maximum-weight triangle packing} problem. Specifically, the input is an edge-weighted complete graph $G = (V, E)$ with $|V| = 3n$, where each vertex is colored red or blue. A {\\em fair triangle} is a triangle containing vertices of both colors. PFTP asks for a partition of $V$ into $n$ fair triangles such that the total edge weight is maximized. To the best of our knowledge, this is the first paper to study PFTP.\n  PFT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07674","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/2608.07674/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":"2608.07674","created_at":"2026-08-11T00:15:40.373808+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07674v1","created_at":"2026-08-11T00:15:40.373808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07674","created_at":"2026-08-11T00:15:40.373808+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GWIC4AZVUUJ","created_at":"2026-08-11T00:15:40.373808+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GWIC4AZVUUJILV5","created_at":"2026-08-11T00:15:40.373808+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GWIC4AZ","created_at":"2026-08-11T00:15:40.373808+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/3GWIC4AZVUUJILV5HHANM2KC4Z","json":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z.json","graph_json":"https://pith.science/api/pith-number/3GWIC4AZVUUJILV5HHANM2KC4Z/graph.json","events_json":"https://pith.science/api/pith-number/3GWIC4AZVUUJILV5HHANM2KC4Z/events.json","paper":"https://pith.science/paper/3GWIC4AZ"},"agent_actions":{"view_html":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z","download_json":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z.json","view_paper":"https://pith.science/paper/3GWIC4AZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07674&json=true","fetch_graph":"https://pith.science/api/pith-number/3GWIC4AZVUUJILV5HHANM2KC4Z/graph.json","fetch_events":"https://pith.science/api/pith-number/3GWIC4AZVUUJILV5HHANM2KC4Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/action/storage_attestation","attest_author":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/action/author_attestation","sign_citation":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/action/citation_signature","submit_replication":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/action/replication_record"}},"created_at":"2026-08-11T00:15:40.373808+00:00","updated_at":"2026-08-11T00:15:40.373808+00:00"}