{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:RDRPC7RDTDMKIGPWMLD7FK7DII","short_pith_number":"pith:RDRPC7RD","canonical_record":{"source":{"id":"1201.0410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-02T01:42:20Z","cross_cats_sorted":["cs.CC","cs.MA"],"title_canon_sha256":"2ac70d0b2f98ae087483c1f79bee37c2f9e056b4244c05e4ff47c63f2bc3b880","abstract_canon_sha256":"48bafd20ecae187bc80105ebf5daf9a292ce8608113d1d9de95fa7737a9513a4"},"schema_version":"1.0"},"canonical_sha256":"88e2f17e2398d8a419f662c7f2abe3421ed0e8553e3bbcc35f1f0a1df60e0b9e","source":{"kind":"arxiv","id":"1201.0410","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0410","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0410v2","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0410","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"RDRPC7RDTDMK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDRPC7RDTDMKIGPW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDRPC7RD","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:RDRPC7RDTDMKIGPWMLD7FK7DII","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0410","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-02T01:42:20Z","cross_cats_sorted":["cs.CC","cs.MA"],"title_canon_sha256":"2ac70d0b2f98ae087483c1f79bee37c2f9e056b4244c05e4ff47c63f2bc3b880","abstract_canon_sha256":"48bafd20ecae187bc80105ebf5daf9a292ce8608113d1d9de95fa7737a9513a4"},"schema_version":"1.0"},"canonical_sha256":"88e2f17e2398d8a419f662c7f2abe3421ed0e8553e3bbcc35f1f0a1df60e0b9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:50.949027Z","signature_b64":"JTvsOz3yKOaP6GQEz/7UoL0lk8uPiXX7j1InmhQs9dbMCralrl6WfBS2+tpmyIGtO3260TAGUXymUlLhL9zIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88e2f17e2398d8a419f662c7f2abe3421ed0e8553e3bbcc35f1f0a1df60e0b9e","last_reissued_at":"2026-05-18T03:58:50.948342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:50.948342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0410","source_version":2,"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-05-18T03:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ved36jYQSp481Ia371/W8oCY2ORmpkDCuOxKqBHcC8tiBfqdueQZBMFSvoLR6maytJogQ9C0alNLHueXpDzkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:22:02.920237Z"},"content_sha256":"c05eb423d024c100bfaede128bd874a2abb4a4489882eda4a431a8a09c0459ed","schema_version":"1.0","event_id":"sha256:c05eb423d024c100bfaede128bd874a2abb4a4489882eda4a431a8a09c0459ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:RDRPC7RDTDMKIGPWMLD7FK7DII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on anti-coordination and social interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.MA"],"primary_cat":"cs.GT","authors_text":"Xiaoguang Yang, Zhigang Cao","submitted_at":"2012-01-02T01:42:20Z","abstract_excerpt":"This note confirms a conjecture of [Bramoull\\'{e}, Anti-coordination and social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The problem, which we name the maximum independent cut problem, is a restricted version of the MAX-CUT problem, requiring one side of the cut to be an independent set. We show that the maximum independent cut problem does not admit any polynomial time algorithm with approximation ratio better than $n^{1-\\epsilon}$, where $n$ is the number of nodes, and $\\epsilon$ arbitrarily small, unless P=NP. For the rather special case where each node has a degree of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0410","kind":"arxiv","version":2},"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"},"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-05-18T03:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nmwwni5GzPgpQzW6reBhMXKsmI8w1BonfKxwaGtxEy+dsqZFkmxBn8e1B0feON45hd9crcJpfknX+TDsJ9xiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:22:02.920913Z"},"content_sha256":"8a7ac55392434d976e0f2088615cb37b7f1a43bee4d2e3478c34b05b66a8e30a","schema_version":"1.0","event_id":"sha256:8a7ac55392434d976e0f2088615cb37b7f1a43bee4d2e3478c34b05b66a8e30a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDRPC7RDTDMKIGPWMLD7FK7DII/bundle.json","state_url":"https://pith.science/pith/RDRPC7RDTDMKIGPWMLD7FK7DII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDRPC7RDTDMKIGPWMLD7FK7DII/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-05-25T15:22:02Z","links":{"resolver":"https://pith.science/pith/RDRPC7RDTDMKIGPWMLD7FK7DII","bundle":"https://pith.science/pith/RDRPC7RDTDMKIGPWMLD7FK7DII/bundle.json","state":"https://pith.science/pith/RDRPC7RDTDMKIGPWMLD7FK7DII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDRPC7RDTDMKIGPWMLD7FK7DII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:RDRPC7RDTDMKIGPWMLD7FK7DII","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":"48bafd20ecae187bc80105ebf5daf9a292ce8608113d1d9de95fa7737a9513a4","cross_cats_sorted":["cs.CC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-02T01:42:20Z","title_canon_sha256":"2ac70d0b2f98ae087483c1f79bee37c2f9e056b4244c05e4ff47c63f2bc3b880"},"schema_version":"1.0","source":{"id":"1201.0410","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0410","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0410v2","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0410","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"RDRPC7RDTDMK","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"RDRPC7RDTDMKIGPW","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"RDRPC7RD","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:8a7ac55392434d976e0f2088615cb37b7f1a43bee4d2e3478c34b05b66a8e30a","target":"graph","created_at":"2026-05-18T03:58:50Z","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"},"paper":{"abstract_excerpt":"This note confirms a conjecture of [Bramoull\\'{e}, Anti-coordination and social interactions, Games and Economic Behavior, 58, 2007: 30-49]. The problem, which we name the maximum independent cut problem, is a restricted version of the MAX-CUT problem, requiring one side of the cut to be an independent set. We show that the maximum independent cut problem does not admit any polynomial time algorithm with approximation ratio better than $n^{1-\\epsilon}$, where $n$ is the number of nodes, and $\\epsilon$ arbitrarily small, unless P=NP. For the rather special case where each node has a degree of a","authors_text":"Xiaoguang Yang, Zhigang Cao","cross_cats":["cs.CC","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-02T01:42:20Z","title":"A note on anti-coordination and social interactions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0410","kind":"arxiv","version":2},"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:c05eb423d024c100bfaede128bd874a2abb4a4489882eda4a431a8a09c0459ed","target":"record","created_at":"2026-05-18T03:58:50Z","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":"48bafd20ecae187bc80105ebf5daf9a292ce8608113d1d9de95fa7737a9513a4","cross_cats_sorted":["cs.CC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-01-02T01:42:20Z","title_canon_sha256":"2ac70d0b2f98ae087483c1f79bee37c2f9e056b4244c05e4ff47c63f2bc3b880"},"schema_version":"1.0","source":{"id":"1201.0410","kind":"arxiv","version":2}},"canonical_sha256":"88e2f17e2398d8a419f662c7f2abe3421ed0e8553e3bbcc35f1f0a1df60e0b9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88e2f17e2398d8a419f662c7f2abe3421ed0e8553e3bbcc35f1f0a1df60e0b9e","first_computed_at":"2026-05-18T03:58:50.948342Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:50.948342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JTvsOz3yKOaP6GQEz/7UoL0lk8uPiXX7j1InmhQs9dbMCralrl6WfBS2+tpmyIGtO3260TAGUXymUlLhL9zIAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:50.949027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0410","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c05eb423d024c100bfaede128bd874a2abb4a4489882eda4a431a8a09c0459ed","sha256:8a7ac55392434d976e0f2088615cb37b7f1a43bee4d2e3478c34b05b66a8e30a"],"state_sha256":"54d46a5af29400ba8a6ab139947a9b3d712485cc17e208343c101c37aa819b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDOGnWcMgCgQwBjAATCbi9qOczi+wHYZS806fAkpeoI9mjinXM0HVVv4SYz8k17e0HAhqlvW2VR/NnjSH1oyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:22:02.924334Z","bundle_sha256":"38d45717ff8346d59c17f1beeca2824592901c4d13285d9c4122254bd53a198f"}}