{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7UWUABKGM7GOSYKVKIQGYR6J3O","short_pith_number":"pith:7UWUABKG","schema_version":"1.0","canonical_sha256":"fd2d40054667cce9615552206c47c9db9e703efa26a532ab30c7d82585b69250","source":{"kind":"arxiv","id":"1712.06690","version":2},"attestation_state":"computed","paper":{"title":"An Experimental Evaluation of a Bounded Expansion Algorithmic Pipeline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Michael P. O'Brien","submitted_at":"2017-12-18T21:58:11Z","abstract_excerpt":"Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering and heavy-tailed degree distributions. As such, fixed-parameter tractable algorithms for bounded expansion classes may offer a promising framework for network analysis where other approaches have struggled to scale. However, there has been little work done in implementing and evaluating the performance of these structure-based algorithms. To this end we intr"},"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":"1712.06690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-18T21:58:11Z","cross_cats_sorted":[],"title_canon_sha256":"72d72c11f5f9609ddce754d0bfed2c24f842f4ace7cb583aaa67251dac6c77b2","abstract_canon_sha256":"979dbd57d9bec7850ff2517c24c76c7d428ca9b5c8f1b4e506d4c9abb59ad4da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:53.844266Z","signature_b64":"k6rz6Y97sG4TGKcNxTGAIAM5oVvCYK1e9G0jItBnxILyma9UaalUMr4/8LoSv6u8sSfhiT/s7XcJkIENvyhJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd2d40054667cce9615552206c47c9db9e703efa26a532ab30c7d82585b69250","last_reissued_at":"2026-05-18T00:17:53.843776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:53.843776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Experimental Evaluation of a Bounded Expansion Algorithmic Pipeline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Blair D. Sullivan, Michael P. O'Brien","submitted_at":"2017-12-18T21:58:11Z","abstract_excerpt":"Previous work has suggested that the structural restrictions of graphs from classes of bounded expansion--locally dense pockets in a globally sparse graph--naturally coincide with common properties of real-world networks such as clustering and heavy-tailed degree distributions. As such, fixed-parameter tractable algorithms for bounded expansion classes may offer a promising framework for network analysis where other approaches have struggled to scale. However, there has been little work done in implementing and evaluating the performance of these structure-based algorithms. To this end we intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06690","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.06690","created_at":"2026-05-18T00:17:53.843847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.06690v2","created_at":"2026-05-18T00:17:53.843847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06690","created_at":"2026-05-18T00:17:53.843847+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UWUABKGM7GO","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UWUABKGM7GOSYKV","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UWUABKG","created_at":"2026-05-18T12:31:05.417338+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/7UWUABKGM7GOSYKVKIQGYR6J3O","json":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O.json","graph_json":"https://pith.science/api/pith-number/7UWUABKGM7GOSYKVKIQGYR6J3O/graph.json","events_json":"https://pith.science/api/pith-number/7UWUABKGM7GOSYKVKIQGYR6J3O/events.json","paper":"https://pith.science/paper/7UWUABKG"},"agent_actions":{"view_html":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O","download_json":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O.json","view_paper":"https://pith.science/paper/7UWUABKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.06690&json=true","fetch_graph":"https://pith.science/api/pith-number/7UWUABKGM7GOSYKVKIQGYR6J3O/graph.json","fetch_events":"https://pith.science/api/pith-number/7UWUABKGM7GOSYKVKIQGYR6J3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O/action/storage_attestation","attest_author":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O/action/author_attestation","sign_citation":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O/action/citation_signature","submit_replication":"https://pith.science/pith/7UWUABKGM7GOSYKVKIQGYR6J3O/action/replication_record"}},"created_at":"2026-05-18T00:17:53.843847+00:00","updated_at":"2026-05-18T00:17:53.843847+00:00"}