{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3GWIC4AZVUUJILV5HHANM2KC4Z","short_pith_number":"pith:3GWIC4AZ","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"},"canonical_sha256":"d9ac817019ad28942ebd39c0d66942e65a0064b0865f16bdfa826c79405dd451","source":{"kind":"arxiv","id":"2608.07674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07674","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07674v1","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07674","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"3GWIC4AZVUUJ","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"3GWIC4AZVUUJILV5","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"3GWIC4AZ","created_at":"2026-08-11T00:15:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3GWIC4AZVUUJILV5HHANM2KC4Z","target":"record","payload":{"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"},"canonical_sha256":"d9ac817019ad28942ebd39c0d66942e65a0064b0865f16bdfa826c79405dd451","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"},"source_kind":"arxiv","source_id":"2608.07674","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T00:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecaaJzp8qbYhS+t8YpZX9zfeQhmq28CXSinsvkIB8eGFMIzPZHmiaFZjaqjn9dheGAZDsdHmVD3FB2sQvU3iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:14:26.086787Z"},"content_sha256":"7dca507a76b4f7c07080d789b2332d4753cb3cd3e28d57c9352ac3b098ccee20","schema_version":"1.0","event_id":"sha256:7dca507a76b4f7c07080d789b2332d4753cb3cd3e28d57c9352ac3b098ccee20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3GWIC4AZVUUJILV5HHANM2KC4Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-11T00:15:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMTxz5rxGGj19Q5mOwvcpQDfZE96pputmJv98VQVMNZ9+4cUiHS3b/21czcipnnY7ZSVILrcJpqceVWIZy5YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T21:14:26.087278Z"},"content_sha256":"fe3fa583e7b0245f41746d3a3cc60f974d5e527a6cdce4e40f57f432f3113726","schema_version":"1.0","event_id":"sha256:fe3fa583e7b0245f41746d3a3cc60f974d5e527a6cdce4e40f57f432f3113726"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/bundle.json","state_url":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T21:14:26Z","links":{"resolver":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z","bundle":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/bundle.json","state":"https://pith.science/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GWIC4AZVUUJILV5HHANM2KC4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3GWIC4AZVUUJILV5HHANM2KC4Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64b5948fd9bd2c2f01453dc8bfd6f06246e30d17cad02143c49e279da6952bcf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-07T18:01:30Z","title_canon_sha256":"e993822fc7f22f5565d14dcf51b31d29e04f2a66d3e7003113fb19b47b63600e"},"schema_version":"1.0","source":{"id":"2608.07674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07674","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07674v1","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07674","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"pith_short_12","alias_value":"3GWIC4AZVUUJ","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"pith_short_16","alias_value":"3GWIC4AZVUUJILV5","created_at":"2026-08-11T00:15:40Z"},{"alias_kind":"pith_short_8","alias_value":"3GWIC4AZ","created_at":"2026-08-11T00:15:40Z"}],"graph_snapshots":[{"event_id":"sha256:fe3fa583e7b0245f41746d3a3cc60f974d5e527a6cdce4e40f57f432f3113726","target":"graph","created_at":"2026-08-11T00:15:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.07674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Brendan Mumey, Mingyang Gong, Zhi-Zhong Chen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-07T18:01:30Z","title":"Approximation Algorithms for Perfect Fair-Triangle Packing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07674","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7dca507a76b4f7c07080d789b2332d4753cb3cd3e28d57c9352ac3b098ccee20","target":"record","created_at":"2026-08-11T00:15:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64b5948fd9bd2c2f01453dc8bfd6f06246e30d17cad02143c49e279da6952bcf","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-07T18:01:30Z","title_canon_sha256":"e993822fc7f22f5565d14dcf51b31d29e04f2a66d3e7003113fb19b47b63600e"},"schema_version":"1.0","source":{"id":"2608.07674","kind":"arxiv","version":1}},"canonical_sha256":"d9ac817019ad28942ebd39c0d66942e65a0064b0865f16bdfa826c79405dd451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9ac817019ad28942ebd39c0d66942e65a0064b0865f16bdfa826c79405dd451","first_computed_at":"2026-08-11T00:15:40.373503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T00:15:40.373503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N8PITEYWeFrJUv7q0Zm/fsrXBHLiHT2Xafxu1v8B2Xf67Vo2EV3ayANI2LTIfwxAYpQ1TbXCmNyljQ2MpendAQ==","signature_status":"signed_v1","signed_at":"2026-08-11T00:15:40.375669Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dca507a76b4f7c07080d789b2332d4753cb3cd3e28d57c9352ac3b098ccee20","sha256:fe3fa583e7b0245f41746d3a3cc60f974d5e527a6cdce4e40f57f432f3113726"],"state_sha256":"391f366e6ac62e17f803873f2de4928485d7f00d4b4fdca00976359d0b342018"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzJ+tgMVWVKRD9REoeJ+34aD0Nc/YCRuCzx1bV+fQsyxR9Zh1nx6meoidrS8OgIKse7L9fQZYQU9EFsGhmeMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T21:14:26.090875Z","bundle_sha256":"a8e715d4e885255080cc732e2a6bff5e34e1b3df48069fd5d9d6f4030d7fa56f"}}