{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UZ3ZKPHIIXJGC6HLJF2GICYGXU","short_pith_number":"pith:UZ3ZKPHI","schema_version":"1.0","canonical_sha256":"a677953ce845d26178eb4974640b06bd2553f32990ca1bb5c93cf5cde1d9791b","source":{"kind":"arxiv","id":"1311.6996","version":1},"attestation_state":"computed","paper":{"title":"Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.CG","authors_text":"Christopher Mears, Kerri Morgan, Kim Marriott, Mark Wallace, Tim Dwyer, Todd Niven","submitted_at":"2013-11-14T03:28:44Z","abstract_excerpt":"Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules. An edge connected to the module then implies a connection to each member of the module. Thus, the entire graph may be represented with much less clutter and without loss of detail. A recent experimental study has shown that such lossless compression of dense graphs makes it easier to follow paths. However, computing optimal power graphs is difficult. In this paper, we show that compu"},"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":"1311.6996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-11-14T03:28:44Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"54c6c319bd9012e66bc8c898dcc83e03aed9a77d05495542fbbe5ea863169b1d","abstract_canon_sha256":"fa1d179c82a601852e1b5f92c5a35abebd745e2c89c1fe34794a28a4ed6756c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:04.371382Z","signature_b64":"YZ/VSiUEmBD4wGA6gnhqk1XaP7B7mvpx4GAfNmzYzNw4RDip0oknPPTjgut8Wj+na9L9r8QeafqUJrtIrHHpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a677953ce845d26178eb4974640b06bd2553f32990ca1bb5c93cf5cde1d9791b","last_reissued_at":"2026-05-18T03:06:04.370818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:04.370818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.CG","authors_text":"Christopher Mears, Kerri Morgan, Kim Marriott, Mark Wallace, Tim Dwyer, Todd Niven","submitted_at":"2013-11-14T03:28:44Z","abstract_excerpt":"Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules. An edge connected to the module then implies a connection to each member of the module. Thus, the entire graph may be represented with much less clutter and without loss of detail. A recent experimental study has shown that such lossless compression of dense graphs makes it easier to follow paths. However, computing optimal power graphs is difficult. In this paper, we show that compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6996","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":"1311.6996","created_at":"2026-05-18T03:06:04.370907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.6996v1","created_at":"2026-05-18T03:06:04.370907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6996","created_at":"2026-05-18T03:06:04.370907+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZ3ZKPHIIXJG","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZ3ZKPHIIXJGC6HL","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZ3ZKPHI","created_at":"2026-05-18T12:28:02.375192+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/UZ3ZKPHIIXJGC6HLJF2GICYGXU","json":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU.json","graph_json":"https://pith.science/api/pith-number/UZ3ZKPHIIXJGC6HLJF2GICYGXU/graph.json","events_json":"https://pith.science/api/pith-number/UZ3ZKPHIIXJGC6HLJF2GICYGXU/events.json","paper":"https://pith.science/paper/UZ3ZKPHI"},"agent_actions":{"view_html":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU","download_json":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU.json","view_paper":"https://pith.science/paper/UZ3ZKPHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.6996&json=true","fetch_graph":"https://pith.science/api/pith-number/UZ3ZKPHIIXJGC6HLJF2GICYGXU/graph.json","fetch_events":"https://pith.science/api/pith-number/UZ3ZKPHIIXJGC6HLJF2GICYGXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU/action/storage_attestation","attest_author":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU/action/author_attestation","sign_citation":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU/action/citation_signature","submit_replication":"https://pith.science/pith/UZ3ZKPHIIXJGC6HLJF2GICYGXU/action/replication_record"}},"created_at":"2026-05-18T03:06:04.370907+00:00","updated_at":"2026-05-18T03:06:04.370907+00:00"}