{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SMI7AOASHJ4QPP43DH2X3PHUPJ","short_pith_number":"pith:SMI7AOAS","schema_version":"1.0","canonical_sha256":"9311f038123a7907bf9b19f57dbcf47a4b77a57b494b33ef33968159e2d5667a","source":{"kind":"arxiv","id":"1006.5802","version":5},"attestation_state":"computed","paper":{"title":"On Graphs and Codes Preserved by Edge Local Complementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Constanza Riera, Joakim Grahl Knudsen, Lars Eirik Danielsen, Matthew G. Parker","submitted_at":"2010-06-30T08:35:36Z","abstract_excerpt":"Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new graph class, ELC-preserved graphs, comprising all graphs that have an ELC orbit of size one. Through an exhaustive search, we find all ELC-preserved graphs of order up to 12 and all ELC-preserved bipartite graphs of order up to 16. We provide general recursive constructions for infinite families of ELC-preserved graphs, and show that all known ELC-preserved"},"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":"1006.5802","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-30T08:35:36Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9764d3f92c3f362186fcf167689985bad76158e15fd983da5038b55de17a4c55","abstract_canon_sha256":"ff0bd76109269f1a807592195fbedf03cecd8f6f34cd54110709eb2d92187f27"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:30.443290Z","signature_b64":"O2/TdXxOqvYHL9lngohPC49e7t0hTKKYC1w4t3UPJaLzK/tZPuSGc95OyNFGqbe1Fh9+JIMwf00ra1ZyFyjeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9311f038123a7907bf9b19f57dbcf47a4b77a57b494b33ef33968159e2d5667a","last_reissued_at":"2026-05-18T03:16:30.442825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:30.442825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Graphs and Codes Preserved by Edge Local Complementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Constanza Riera, Joakim Grahl Knudsen, Lars Eirik Danielsen, Matthew G. Parker","submitted_at":"2010-06-30T08:35:36Z","abstract_excerpt":"Orbits of graphs under local complementation (LC) and edge local complementation (ELC) have been studied in several different contexts. For instance, there are connections between orbits of graphs and error-correcting codes. We define a new graph class, ELC-preserved graphs, comprising all graphs that have an ELC orbit of size one. Through an exhaustive search, we find all ELC-preserved graphs of order up to 12 and all ELC-preserved bipartite graphs of order up to 16. We provide general recursive constructions for infinite families of ELC-preserved graphs, and show that all known ELC-preserved"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5802","kind":"arxiv","version":5},"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":"1006.5802","created_at":"2026-05-18T03:16:30.442903+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.5802v5","created_at":"2026-05-18T03:16:30.442903+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5802","created_at":"2026-05-18T03:16:30.442903+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMI7AOASHJ4Q","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMI7AOASHJ4QPP43","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMI7AOAS","created_at":"2026-05-18T12:26:13.927090+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/SMI7AOASHJ4QPP43DH2X3PHUPJ","json":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ.json","graph_json":"https://pith.science/api/pith-number/SMI7AOASHJ4QPP43DH2X3PHUPJ/graph.json","events_json":"https://pith.science/api/pith-number/SMI7AOASHJ4QPP43DH2X3PHUPJ/events.json","paper":"https://pith.science/paper/SMI7AOAS"},"agent_actions":{"view_html":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ","download_json":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ.json","view_paper":"https://pith.science/paper/SMI7AOAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.5802&json=true","fetch_graph":"https://pith.science/api/pith-number/SMI7AOASHJ4QPP43DH2X3PHUPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/SMI7AOASHJ4QPP43DH2X3PHUPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ/action/storage_attestation","attest_author":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ/action/author_attestation","sign_citation":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ/action/citation_signature","submit_replication":"https://pith.science/pith/SMI7AOASHJ4QPP43DH2X3PHUPJ/action/replication_record"}},"created_at":"2026-05-18T03:16:30.442903+00:00","updated_at":"2026-05-18T03:16:30.442903+00:00"}