{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OZVTJLMSEL6D6L4UZSIFKO3UEH","short_pith_number":"pith:OZVTJLMS","schema_version":"1.0","canonical_sha256":"766b34ad9222fc3f2f94cc90553b7421f71938e941d8235df99209d0668f684d","source":{"kind":"arxiv","id":"1707.04480","version":1},"attestation_state":"computed","paper":{"title":"Layout of random circulant graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Israel Rocha, Sebastian Richter","submitted_at":"2017-07-14T12:25:28Z","abstract_excerpt":"A circulant graph H is defined on the set of vertices V=\\left\\{ 1,\\ldots,n\\right\\} and edges E=\\left\\{ \\left(i,j\\right):\\left|i-j\\right|\\equiv s\\left(\\textrm{mod}n\\right),s\\in S\\right\\} , where S\\subseteq\\left\\{ 1,\\ldots,\\lceil\\frac{n-1}{2}\\rceil\\right\\} . A random circulant graph results from deleting edges of H with probability 1-p. We provide a polynomial time algorithm that approximates the solution to the minimum linear arrangement problem for random circulant graphs. We then bound the error of the approximation with high probability."},"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":"1707.04480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T12:25:28Z","cross_cats_sorted":[],"title_canon_sha256":"f36730449497847521e7cc83493cfbedd18f5b110de11bd74f70280ea4b4c7ff","abstract_canon_sha256":"d1077bfca2517fff0d2c59dfbbda18a3f13aa8e82e31bd9a97c8239f636bbb85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.043285Z","signature_b64":"fkhxI+tUNguuZyamtFG6A5LywmDOSlPLfLVTmZGhcvrl7LkvwE7T+EnlXEaGO8LjRr90BVPcfA6nbJ+BCVVEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766b34ad9222fc3f2f94cc90553b7421f71938e941d8235df99209d0668f684d","last_reissued_at":"2026-05-18T00:40:18.042608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.042608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layout of random circulant graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Israel Rocha, Sebastian Richter","submitted_at":"2017-07-14T12:25:28Z","abstract_excerpt":"A circulant graph H is defined on the set of vertices V=\\left\\{ 1,\\ldots,n\\right\\} and edges E=\\left\\{ \\left(i,j\\right):\\left|i-j\\right|\\equiv s\\left(\\textrm{mod}n\\right),s\\in S\\right\\} , where S\\subseteq\\left\\{ 1,\\ldots,\\lceil\\frac{n-1}{2}\\rceil\\right\\} . A random circulant graph results from deleting edges of H with probability 1-p. We provide a polynomial time algorithm that approximates the solution to the minimum linear arrangement problem for random circulant graphs. We then bound the error of the approximation with high probability."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04480","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":"1707.04480","created_at":"2026-05-18T00:40:18.042713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04480v1","created_at":"2026-05-18T00:40:18.042713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04480","created_at":"2026-05-18T00:40:18.042713+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZVTJLMSEL6D","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZVTJLMSEL6D6L4U","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZVTJLMS","created_at":"2026-05-18T12:31:37.085036+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/OZVTJLMSEL6D6L4UZSIFKO3UEH","json":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH.json","graph_json":"https://pith.science/api/pith-number/OZVTJLMSEL6D6L4UZSIFKO3UEH/graph.json","events_json":"https://pith.science/api/pith-number/OZVTJLMSEL6D6L4UZSIFKO3UEH/events.json","paper":"https://pith.science/paper/OZVTJLMS"},"agent_actions":{"view_html":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH","download_json":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH.json","view_paper":"https://pith.science/paper/OZVTJLMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04480&json=true","fetch_graph":"https://pith.science/api/pith-number/OZVTJLMSEL6D6L4UZSIFKO3UEH/graph.json","fetch_events":"https://pith.science/api/pith-number/OZVTJLMSEL6D6L4UZSIFKO3UEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/action/storage_attestation","attest_author":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/action/author_attestation","sign_citation":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/action/citation_signature","submit_replication":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/action/replication_record"}},"created_at":"2026-05-18T00:40:18.042713+00:00","updated_at":"2026-05-18T00:40:18.042713+00:00"}