{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:6CTDHPGKVKSR6T35IR4C6TI2BA","short_pith_number":"pith:6CTDHPGK","canonical_record":{"source":{"id":"2208.10334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-08-19T13:51:44Z","cross_cats_sorted":["cs.GR","cs.LG"],"title_canon_sha256":"da0baa5375dd1a64bff187e89464f2d3d1644389bd53b19994ab8beb72af9021","abstract_canon_sha256":"fe9d76d72d443ba89ee1175a21e2f582a8d103f0d7594597345d08c9445ecbc2"},"schema_version":"1.0"},"canonical_sha256":"f0a633bccaaaa51f4f7d44782f4d1a0805a29152240b84e4dda1cc7bdab5f2ab","source":{"kind":"arxiv","id":"2208.10334","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.10334","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"2208.10334v2","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10334","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"6CTDHPGKVKSR","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"pith_short_16","alias_value":"6CTDHPGKVKSR6T35","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"pith_short_8","alias_value":"6CTDHPGK","created_at":"2026-07-05T06:01:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:6CTDHPGKVKSR6T35IR4C6TI2BA","target":"record","payload":{"canonical_record":{"source":{"id":"2208.10334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-08-19T13:51:44Z","cross_cats_sorted":["cs.GR","cs.LG"],"title_canon_sha256":"da0baa5375dd1a64bff187e89464f2d3d1644389bd53b19994ab8beb72af9021","abstract_canon_sha256":"fe9d76d72d443ba89ee1175a21e2f582a8d103f0d7594597345d08c9445ecbc2"},"schema_version":"1.0"},"canonical_sha256":"f0a633bccaaaa51f4f7d44782f4d1a0805a29152240b84e4dda1cc7bdab5f2ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:35.128965Z","signature_b64":"VKqv+wrs3O4CP/HeegB1Wh6W+6Kj/uwBU9jt5j+EA1k0wV8qk1Lsjt2pwXjX5cXkDc3p6+I7OiTDD6csligsDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a633bccaaaa51f4f7d44782f4d1a0805a29152240b84e4dda1cc7bdab5f2ab","last_reissued_at":"2026-07-05T06:01:35.128413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:35.128413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.10334","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-07-05T06:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOH4FEGs17aBKAEWvlyawSBjJ7UWfdSl61JCs1YUx596SC/mRMqDc7ehVb1I2oiLjxpt3A5IsB+ExoWPTxwiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:55:07.424366Z"},"content_sha256":"6837b566c735272a48559f472fed32de433b31aa7b338acf000bca0cc854b3c6","schema_version":"1.0","event_id":"sha256:6837b566c735272a48559f472fed32de433b31aa7b338acf000bca0cc854b3c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:6CTDHPGKVKSR6T35IR4C6TI2BA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR","cs.LG"],"primary_cat":"cs.CG","authors_text":"Frederic Lalanne, Loann Giovannangeli, Romain Bourqui, Romain Giot","submitted_at":"2022-08-19T13:51:44Z","abstract_excerpt":"While many graph drawing algorithms consider nodes as points, graph visualization tools often represent them as shapes. These shapes support the display of information such as labels or encode various data with size or color. However, they can create overlaps between nodes which hinder the exploration process by hiding parts of the information. It is therefore of utmost importance to remove these overlaps to improve graph visualization readability. If not handled by the layout process, Overlap Removal (OR) algorithms have been proposed as layout post-processing. As graph layouts usually convey"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10334","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.10334/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-07-05T06:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0DWSW9BlF7bWuOkoJgo69aX/sArjE586KoUmwSCJacSmsFjjbrCNza/fe2kMXsXddoWUqnSzQPP/ZnVyHXWuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T08:55:07.425118Z"},"content_sha256":"26125e23efa6d6dd599a4128ed9af577b1b749bf2cfb204f9c697623f00d37ce","schema_version":"1.0","event_id":"sha256:26125e23efa6d6dd599a4128ed9af577b1b749bf2cfb204f9c697623f00d37ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CTDHPGKVKSR6T35IR4C6TI2BA/bundle.json","state_url":"https://pith.science/pith/6CTDHPGKVKSR6T35IR4C6TI2BA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CTDHPGKVKSR6T35IR4C6TI2BA/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-17T08:55:07Z","links":{"resolver":"https://pith.science/pith/6CTDHPGKVKSR6T35IR4C6TI2BA","bundle":"https://pith.science/pith/6CTDHPGKVKSR6T35IR4C6TI2BA/bundle.json","state":"https://pith.science/pith/6CTDHPGKVKSR6T35IR4C6TI2BA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CTDHPGKVKSR6T35IR4C6TI2BA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:6CTDHPGKVKSR6T35IR4C6TI2BA","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":"fe9d76d72d443ba89ee1175a21e2f582a8d103f0d7594597345d08c9445ecbc2","cross_cats_sorted":["cs.GR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-08-19T13:51:44Z","title_canon_sha256":"da0baa5375dd1a64bff187e89464f2d3d1644389bd53b19994ab8beb72af9021"},"schema_version":"1.0","source":{"id":"2208.10334","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.10334","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"2208.10334v2","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10334","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"6CTDHPGKVKSR","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"pith_short_16","alias_value":"6CTDHPGKVKSR6T35","created_at":"2026-07-05T06:01:35Z"},{"alias_kind":"pith_short_8","alias_value":"6CTDHPGK","created_at":"2026-07-05T06:01:35Z"}],"graph_snapshots":[{"event_id":"sha256:26125e23efa6d6dd599a4128ed9af577b1b749bf2cfb204f9c697623f00d37ce","target":"graph","created_at":"2026-07-05T06:01:35Z","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/2208.10334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"While many graph drawing algorithms consider nodes as points, graph visualization tools often represent them as shapes. These shapes support the display of information such as labels or encode various data with size or color. However, they can create overlaps between nodes which hinder the exploration process by hiding parts of the information. It is therefore of utmost importance to remove these overlaps to improve graph visualization readability. If not handled by the layout process, Overlap Removal (OR) algorithms have been proposed as layout post-processing. As graph layouts usually convey","authors_text":"Frederic Lalanne, Loann Giovannangeli, Romain Bourqui, Romain Giot","cross_cats":["cs.GR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-08-19T13:51:44Z","title":"FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10334","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:6837b566c735272a48559f472fed32de433b31aa7b338acf000bca0cc854b3c6","target":"record","created_at":"2026-07-05T06:01:35Z","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":"fe9d76d72d443ba89ee1175a21e2f582a8d103f0d7594597345d08c9445ecbc2","cross_cats_sorted":["cs.GR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2022-08-19T13:51:44Z","title_canon_sha256":"da0baa5375dd1a64bff187e89464f2d3d1644389bd53b19994ab8beb72af9021"},"schema_version":"1.0","source":{"id":"2208.10334","kind":"arxiv","version":2}},"canonical_sha256":"f0a633bccaaaa51f4f7d44782f4d1a0805a29152240b84e4dda1cc7bdab5f2ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a633bccaaaa51f4f7d44782f4d1a0805a29152240b84e4dda1cc7bdab5f2ab","first_computed_at":"2026-07-05T06:01:35.128413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:01:35.128413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VKqv+wrs3O4CP/HeegB1Wh6W+6Kj/uwBU9jt5j+EA1k0wV8qk1Lsjt2pwXjX5cXkDc3p6+I7OiTDD6csligsDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:01:35.128965Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.10334","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6837b566c735272a48559f472fed32de433b31aa7b338acf000bca0cc854b3c6","sha256:26125e23efa6d6dd599a4128ed9af577b1b749bf2cfb204f9c697623f00d37ce"],"state_sha256":"d7c41a4e534355f56abeaadbd274e767ded41dc2ed0d39b80ee32a1caf36c798"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e/OmO/gcorZk6N3wgCbAhBSPSsjuFzK3Bb0IMpIMnrCwBOuBOzICFyTANdFS7IASVn1bo51+8ilv0CAD6KuhCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T08:55:07.430209Z","bundle_sha256":"bb82b1eded040fc77edb66143f9e0e5488f349dafa84e1f7034008884dfc5cfa"}}