{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UVI3NZ6JNB4EK425TNSEFORB6I","short_pith_number":"pith:UVI3NZ6J","schema_version":"1.0","canonical_sha256":"a551b6e7c9687845735d9b6442ba21f221739b25f12ec5499f4480a2cd6c9d74","source":{"kind":"arxiv","id":"1905.08127","version":1},"attestation_state":"computed","paper":{"title":"Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Mahdi Boroujeni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani, Soheil Ehsani","submitted_at":"2019-05-20T14:08:12Z","abstract_excerpt":"Despite persistent efforts, there is no known technique for obtaining unconditional super-linear lower bounds for the computational complexity of the problems in P. Vassilevska Williams and Williams introduce a fruitful approach to advance a better understanding of the computational complexity of the problems in P. In particular, they consider All Pairs Shortest Paths (APSP) and other fundamental problems such as checking whether a matrix defines a metric, verifying the correctness of a matrix product, and detecting a negative triangle in a graph. Abboud, Grandoni, and Vassilevska Williams stu"},"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":"1905.08127","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-20T14:08:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c794446f3e943396ede412cf47930765145639e7d632aa19b69b48ede21fe5cb","abstract_canon_sha256":"d001ef3189e7e2ac48d53f690961175da3523fe8ce71c5be5c1c133e959f91e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.497454Z","signature_b64":"gyA66o5Es3rLjNU2yGMocp2BDTNO/l/QdA1IKDZlTiYzQxFJmLdzX0QTvm92yTmR43+6nV2apeDxfLbKnpLdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a551b6e7c9687845735d9b6442ba21f221739b25f12ec5499f4480a2cd6c9d74","last_reissued_at":"2026-05-17T23:45:47.496959Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.496959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subcubic Equivalences Between Graph Centrality Measures and Complementary Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Mahdi Boroujeni, MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani, Soheil Ehsani","submitted_at":"2019-05-20T14:08:12Z","abstract_excerpt":"Despite persistent efforts, there is no known technique for obtaining unconditional super-linear lower bounds for the computational complexity of the problems in P. Vassilevska Williams and Williams introduce a fruitful approach to advance a better understanding of the computational complexity of the problems in P. In particular, they consider All Pairs Shortest Paths (APSP) and other fundamental problems such as checking whether a matrix defines a metric, verifying the correctness of a matrix product, and detecting a negative triangle in a graph. Abboud, Grandoni, and Vassilevska Williams stu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08127","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":"1905.08127","created_at":"2026-05-17T23:45:47.497035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08127v1","created_at":"2026-05-17T23:45:47.497035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08127","created_at":"2026-05-17T23:45:47.497035+00:00"},{"alias_kind":"pith_short_12","alias_value":"UVI3NZ6JNB4E","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UVI3NZ6JNB4EK425","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UVI3NZ6J","created_at":"2026-05-18T12:33:30.264802+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/UVI3NZ6JNB4EK425TNSEFORB6I","json":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I.json","graph_json":"https://pith.science/api/pith-number/UVI3NZ6JNB4EK425TNSEFORB6I/graph.json","events_json":"https://pith.science/api/pith-number/UVI3NZ6JNB4EK425TNSEFORB6I/events.json","paper":"https://pith.science/paper/UVI3NZ6J"},"agent_actions":{"view_html":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I","download_json":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I.json","view_paper":"https://pith.science/paper/UVI3NZ6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08127&json=true","fetch_graph":"https://pith.science/api/pith-number/UVI3NZ6JNB4EK425TNSEFORB6I/graph.json","fetch_events":"https://pith.science/api/pith-number/UVI3NZ6JNB4EK425TNSEFORB6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I/action/storage_attestation","attest_author":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I/action/author_attestation","sign_citation":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I/action/citation_signature","submit_replication":"https://pith.science/pith/UVI3NZ6JNB4EK425TNSEFORB6I/action/replication_record"}},"created_at":"2026-05-17T23:45:47.497035+00:00","updated_at":"2026-05-17T23:45:47.497035+00:00"}