{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZMN44NDPWRHAOE6Q5BZ43Q2MXS","short_pith_number":"pith:ZMN44NDP","schema_version":"1.0","canonical_sha256":"cb1bce346fb44e0713d0e873cdc34cbcbd78cc5e5010dbd684c4fafc0cd02e4d","source":{"kind":"arxiv","id":"1201.1869","version":1},"attestation_state":"computed","paper":{"title":"Sitting closer to friends than enemies, revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2012-01-09T18:45:36Z","abstract_excerpt":"Signed graphs, i.e., undirected graphs with edges labelled with a plus or minus sign, are commonly used to model relationships in social networks. Recently, Kermarrec and Thraves initiated the study of the problem of appropriately visualising the network: They asked whether any signed graph can be embedded into the metric space R^l in such a manner that every vertex is closer to all its friends (neighbours via positive edges) than to all its enemies (neighbours via negative edges). Interestingly, embeddability into R^1 can be expressed as a purely combinatorial problem. In this paper we pursue"},"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":"1201.1869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-09T18:45:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1c8cea085f03f4dc4573f0dead2c239730fd73c349f3e2943db8fe66f418cfa4","abstract_canon_sha256":"4f71239cb90998dc81428ebd3cac54b92fcc186ac20dd96e021000fe1710cb67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:55.475382Z","signature_b64":"6tkbR394/sgJ4tQZLS8S+/hn9hY79igoKO6KvDLbuDI0TPWSJUqD/YwMgrAVkSY686DRjFpniF4VH/8FBsfRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb1bce346fb44e0713d0e873cdc34cbcbd78cc5e5010dbd684c4fafc0cd02e4d","last_reissued_at":"2026-05-18T04:04:55.474747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:55.474747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sitting closer to friends than enemies, revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jakub Onufry Wojtaszczyk, Marcin Pilipczuk, Marek Cygan, Micha{\\l} Pilipczuk","submitted_at":"2012-01-09T18:45:36Z","abstract_excerpt":"Signed graphs, i.e., undirected graphs with edges labelled with a plus or minus sign, are commonly used to model relationships in social networks. Recently, Kermarrec and Thraves initiated the study of the problem of appropriately visualising the network: They asked whether any signed graph can be embedded into the metric space R^l in such a manner that every vertex is closer to all its friends (neighbours via positive edges) than to all its enemies (neighbours via negative edges). Interestingly, embeddability into R^1 can be expressed as a purely combinatorial problem. In this paper we pursue"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.1869","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":"1201.1869","created_at":"2026-05-18T04:04:55.474836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.1869v1","created_at":"2026-05-18T04:04:55.474836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.1869","created_at":"2026-05-18T04:04:55.474836+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMN44NDPWRHA","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMN44NDPWRHAOE6Q","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMN44NDP","created_at":"2026-05-18T12:27:30.460161+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/ZMN44NDPWRHAOE6Q5BZ43Q2MXS","json":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS.json","graph_json":"https://pith.science/api/pith-number/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/graph.json","events_json":"https://pith.science/api/pith-number/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/events.json","paper":"https://pith.science/paper/ZMN44NDP"},"agent_actions":{"view_html":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS","download_json":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS.json","view_paper":"https://pith.science/paper/ZMN44NDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.1869&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/action/storage_attestation","attest_author":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/action/author_attestation","sign_citation":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/action/citation_signature","submit_replication":"https://pith.science/pith/ZMN44NDPWRHAOE6Q5BZ43Q2MXS/action/replication_record"}},"created_at":"2026-05-18T04:04:55.474836+00:00","updated_at":"2026-05-18T04:04:55.474836+00:00"}