{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OZVTJLMSEL6D6L4UZSIFKO3UEH","short_pith_number":"pith:OZVTJLMS","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"},"canonical_sha256":"766b34ad9222fc3f2f94cc90553b7421f71938e941d8235df99209d0668f684d","source":{"kind":"arxiv","id":"1707.04480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04480","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04480v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04480","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"OZVTJLMSEL6D","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"OZVTJLMSEL6D6L4U","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"OZVTJLMS","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OZVTJLMSEL6D6L4UZSIFKO3UEH","target":"record","payload":{"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"},"canonical_sha256":"766b34ad9222fc3f2f94cc90553b7421f71938e941d8235df99209d0668f684d","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"},"source_kind":"arxiv","source_id":"1707.04480","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNZ6TVaUv7+oPEN0f1MRRMnbwPBeycbVXndbVwlhgX006oVurzN35PW6I2nXYv+RdxdlpmzuxNT0zd/bLKSOCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:41:01.329153Z"},"content_sha256":"1385cd0539af4641f62acead76474577c8cd2e5d04440382acd1b3ddfa40d843","schema_version":"1.0","event_id":"sha256:1385cd0539af4641f62acead76474577c8cd2e5d04440382acd1b3ddfa40d843"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OZVTJLMSEL6D6L4UZSIFKO3UEH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2DoYK+QejHtt04YhFCqSMrmskf/XTHHY4cDor0jPNwOLGK10OryEZuAPwOaPtdcad43PY8sqgOQZYbsg/wsOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:41:01.329885Z"},"content_sha256":"3d181a784391dfcfac93555b3acd865857add0fedce8eee1608aaad6078d0ef5","schema_version":"1.0","event_id":"sha256:3d181a784391dfcfac93555b3acd865857add0fedce8eee1608aaad6078d0ef5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/bundle.json","state_url":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T07:41:01Z","links":{"resolver":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH","bundle":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/bundle.json","state":"https://pith.science/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZVTJLMSEL6D6L4UZSIFKO3UEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OZVTJLMSEL6D6L4UZSIFKO3UEH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d1077bfca2517fff0d2c59dfbbda18a3f13aa8e82e31bd9a97c8239f636bbb85","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T12:25:28Z","title_canon_sha256":"f36730449497847521e7cc83493cfbedd18f5b110de11bd74f70280ea4b4c7ff"},"schema_version":"1.0","source":{"id":"1707.04480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04480","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04480v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04480","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"OZVTJLMSEL6D","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"OZVTJLMSEL6D6L4U","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"OZVTJLMS","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:3d181a784391dfcfac93555b3acd865857add0fedce8eee1608aaad6078d0ef5","target":"graph","created_at":"2026-05-18T00:40:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Israel Rocha, Sebastian Richter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T12:25:28Z","title":"Layout of random circulant graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04480","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1385cd0539af4641f62acead76474577c8cd2e5d04440382acd1b3ddfa40d843","target":"record","created_at":"2026-05-18T00:40:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d1077bfca2517fff0d2c59dfbbda18a3f13aa8e82e31bd9a97c8239f636bbb85","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2017-07-14T12:25:28Z","title_canon_sha256":"f36730449497847521e7cc83493cfbedd18f5b110de11bd74f70280ea4b4c7ff"},"schema_version":"1.0","source":{"id":"1707.04480","kind":"arxiv","version":1}},"canonical_sha256":"766b34ad9222fc3f2f94cc90553b7421f71938e941d8235df99209d0668f684d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"766b34ad9222fc3f2f94cc90553b7421f71938e941d8235df99209d0668f684d","first_computed_at":"2026-05-18T00:40:18.042608Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.042608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fkhxI+tUNguuZyamtFG6A5LywmDOSlPLfLVTmZGhcvrl7LkvwE7T+EnlXEaGO8LjRr90BVPcfA6nbJ+BCVVEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.043285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1385cd0539af4641f62acead76474577c8cd2e5d04440382acd1b3ddfa40d843","sha256:3d181a784391dfcfac93555b3acd865857add0fedce8eee1608aaad6078d0ef5"],"state_sha256":"b7fb0650119f907dd364af81186909c575990f1bd1a4ec4854803c682d2cbed0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5oUW+HCdwObNuW6ZiJy6JVNU9UPCiDCLcOFmSOcGeaS6rMy0hrXUtL6SzBbJoMmF7QLTHJOFa7gpQ0/x9RzBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:41:01.333654Z","bundle_sha256":"6f8287a416f4b3d4da05a60091edf87afc92dd3d03264fcfd2d9900bcfec146b"}}