{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3HHWFVBAHA3CMYHC3IVW2FQP3I","short_pith_number":"pith:3HHWFVBA","schema_version":"1.0","canonical_sha256":"d9cf62d42038362660e2da2b6d160fda36a4296ac94dc26ce246514ad14445d8","source":{"kind":"arxiv","id":"1605.08863","version":1},"attestation_state":"computed","paper":{"title":"Approximation of barter exchanges with cycle length constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chenggang Wu, Jianyang Zeng, Pingzhong Tang, Suiqian Luo","submitted_at":"2016-05-28T09:00:20Z","abstract_excerpt":"We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cycles that maximize the total weight in a weighted digraph. The problem has previously been shown to be NP-hard. We advance the understanding of this problem by the following contributions.\n  We prove three constant inapproximability results for this problem. For the weighted graphs, we prove that it is NP-hard to approximate the clearing problem within a factor of 14/13 under general length constraints and within a fa"},"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":"1605.08863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-05-28T09:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"3e2c1f0a3cdfdc5fff6bccac3cd5f282c282578b1d1400538eb9063578671b11","abstract_canon_sha256":"0b21456d6e3b978f799aef031b6963571ce554a3f495a5aeee214ea763aff31c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:22.821551Z","signature_b64":"/v3cXCV+3Yq/NTlNyW/z7tluUaowk4ho7YxH5wLIBfr8RGWulpbJzTCZ81SGzwMoxXUKfKG+O1V3M4vxq1yoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9cf62d42038362660e2da2b6d160fda36a4296ac94dc26ce246514ad14445d8","last_reissued_at":"2026-05-18T01:13:22.821043Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:22.821043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation of barter exchanges with cycle length constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Chenggang Wu, Jianyang Zeng, Pingzhong Tang, Suiqian Luo","submitted_at":"2016-05-28T09:00:20Z","abstract_excerpt":"We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cycles that maximize the total weight in a weighted digraph. The problem has previously been shown to be NP-hard. We advance the understanding of this problem by the following contributions.\n  We prove three constant inapproximability results for this problem. For the weighted graphs, we prove that it is NP-hard to approximate the clearing problem within a factor of 14/13 under general length constraints and within a fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08863","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":"1605.08863","created_at":"2026-05-18T01:13:22.821114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08863v1","created_at":"2026-05-18T01:13:22.821114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08863","created_at":"2026-05-18T01:13:22.821114+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HHWFVBAHA3C","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HHWFVBAHA3CMYHC","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HHWFVBA","created_at":"2026-05-18T12:29:55.572404+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/3HHWFVBAHA3CMYHC3IVW2FQP3I","json":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I.json","graph_json":"https://pith.science/api/pith-number/3HHWFVBAHA3CMYHC3IVW2FQP3I/graph.json","events_json":"https://pith.science/api/pith-number/3HHWFVBAHA3CMYHC3IVW2FQP3I/events.json","paper":"https://pith.science/paper/3HHWFVBA"},"agent_actions":{"view_html":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I","download_json":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I.json","view_paper":"https://pith.science/paper/3HHWFVBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08863&json=true","fetch_graph":"https://pith.science/api/pith-number/3HHWFVBAHA3CMYHC3IVW2FQP3I/graph.json","fetch_events":"https://pith.science/api/pith-number/3HHWFVBAHA3CMYHC3IVW2FQP3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I/action/storage_attestation","attest_author":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I/action/author_attestation","sign_citation":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I/action/citation_signature","submit_replication":"https://pith.science/pith/3HHWFVBAHA3CMYHC3IVW2FQP3I/action/replication_record"}},"created_at":"2026-05-18T01:13:22.821114+00:00","updated_at":"2026-05-18T01:13:22.821114+00:00"}