{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4OXATLJVUEYJRBFULPT2HKUVVZ","short_pith_number":"pith:4OXATLJV","canonical_record":{"source":{"id":"1101.1932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T19:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"4cf698c37b7bdef6b7eb7c1777d3371e5212c4b1c391b2a88ef599e555b22fb0","abstract_canon_sha256":"b79f4a7f1deac016764a33ab47c85e250ce96b159c9f1454b1281a09dfa59e4b"},"schema_version":"1.0"},"canonical_sha256":"e3ae09ad35a1309884b45be7a3aa95ae5d637607a1a894702ef0654dcee5639c","source":{"kind":"arxiv","id":"1101.1932","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1932","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1932v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1932","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"4OXATLJVUEYJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4OXATLJVUEYJRBFU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4OXATLJV","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4OXATLJVUEYJRBFULPT2HKUVVZ","target":"record","payload":{"canonical_record":{"source":{"id":"1101.1932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T19:34:56Z","cross_cats_sorted":[],"title_canon_sha256":"4cf698c37b7bdef6b7eb7c1777d3371e5212c4b1c391b2a88ef599e555b22fb0","abstract_canon_sha256":"b79f4a7f1deac016764a33ab47c85e250ce96b159c9f1454b1281a09dfa59e4b"},"schema_version":"1.0"},"canonical_sha256":"e3ae09ad35a1309884b45be7a3aa95ae5d637607a1a894702ef0654dcee5639c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:51.396568Z","signature_b64":"8muFLKWokgRAi/MmZ7SivunWWWwdmn2TWl7zU8PS+LAt7BHCHxjwC7lafvDCp5CZgpY+xVOihrX+7koG7Gk5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3ae09ad35a1309884b45be7a3aa95ae5d637607a1a894702ef0654dcee5639c","last_reissued_at":"2026-05-18T04:31:51.396015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:51.396015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.1932","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-18T04:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88EFsnMwxizcw8pp6Q0cHfAmfMJW/4pdXTnQnvttVNz1bDZmSvrXdrnMlNiN6AXwg9OqEzDY+ibu47i3bIJuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:58.230687Z"},"content_sha256":"8a5d9789a888c5b3a18d1a381d4e172b9b3407e704f82cf4a8a4b38133b1434c","schema_version":"1.0","event_id":"sha256:8a5d9789a888c5b3a18d1a381d4e172b9b3407e704f82cf4a8a4b38133b1434c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4OXATLJVUEYJRBFULPT2HKUVVZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient tilings of de Bruijn and Kautz graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jud Leonard, Lawrence C. Stewart, Washington Taylor","submitted_at":"2011-01-10T19:34:56Z","abstract_excerpt":"Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to have a means of constructing a large-scale system from smaller, simpler modules. In this paper we consider the mathematical problem of uniformly tiling a de Bruijn or Kautz graph. This can be viewed as a generalization of the graph bisection problem. We focus on the problem of graph tilings by a set of identical subgraphs. Tiles should contain a maximal num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1932","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-18T04:31:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvWQvfpjnj1f4trwdykTQbFqXei3ZKswt/XBa2hbyeirqK3OhxIUwlEEMQNIamV2YQ8wLQCfWOgjiQX2/ZQgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:56:58.231378Z"},"content_sha256":"673933043d2f7005233e6727c612406197f4b35cea5fa4c2445d54bcb85ce8f7","schema_version":"1.0","event_id":"sha256:673933043d2f7005233e6727c612406197f4b35cea5fa4c2445d54bcb85ce8f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/bundle.json","state_url":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/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-05-26T13:56:58Z","links":{"resolver":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ","bundle":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/bundle.json","state":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4OXATLJVUEYJRBFULPT2HKUVVZ","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":"b79f4a7f1deac016764a33ab47c85e250ce96b159c9f1454b1281a09dfa59e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T19:34:56Z","title_canon_sha256":"4cf698c37b7bdef6b7eb7c1777d3371e5212c4b1c391b2a88ef599e555b22fb0"},"schema_version":"1.0","source":{"id":"1101.1932","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.1932","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"arxiv_version","alias_value":"1101.1932v1","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1932","created_at":"2026-05-18T04:31:51Z"},{"alias_kind":"pith_short_12","alias_value":"4OXATLJVUEYJ","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4OXATLJVUEYJRBFU","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4OXATLJV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:673933043d2f7005233e6727c612406197f4b35cea5fa4c2445d54bcb85ce8f7","target":"graph","created_at":"2026-05-18T04:31:51Z","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":"Kautz and de Bruijn graphs have a high degree of connectivity which makes them ideal candidates for massively parallel computer network topologies. In order to realize a practical computer architecture based on these graphs, it is useful to have a means of constructing a large-scale system from smaller, simpler modules. In this paper we consider the mathematical problem of uniformly tiling a de Bruijn or Kautz graph. This can be viewed as a generalization of the graph bisection problem. We focus on the problem of graph tilings by a set of identical subgraphs. Tiles should contain a maximal num","authors_text":"Jud Leonard, Lawrence C. Stewart, Washington Taylor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T19:34:56Z","title":"Efficient tilings of de Bruijn and Kautz graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1932","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:8a5d9789a888c5b3a18d1a381d4e172b9b3407e704f82cf4a8a4b38133b1434c","target":"record","created_at":"2026-05-18T04:31:51Z","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":"b79f4a7f1deac016764a33ab47c85e250ce96b159c9f1454b1281a09dfa59e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-01-10T19:34:56Z","title_canon_sha256":"4cf698c37b7bdef6b7eb7c1777d3371e5212c4b1c391b2a88ef599e555b22fb0"},"schema_version":"1.0","source":{"id":"1101.1932","kind":"arxiv","version":1}},"canonical_sha256":"e3ae09ad35a1309884b45be7a3aa95ae5d637607a1a894702ef0654dcee5639c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3ae09ad35a1309884b45be7a3aa95ae5d637607a1a894702ef0654dcee5639c","first_computed_at":"2026-05-18T04:31:51.396015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:51.396015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8muFLKWokgRAi/MmZ7SivunWWWwdmn2TWl7zU8PS+LAt7BHCHxjwC7lafvDCp5CZgpY+xVOihrX+7koG7Gk5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:51.396568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.1932","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a5d9789a888c5b3a18d1a381d4e172b9b3407e704f82cf4a8a4b38133b1434c","sha256:673933043d2f7005233e6727c612406197f4b35cea5fa4c2445d54bcb85ce8f7"],"state_sha256":"199b8bd576527fada6e6eb72541a3fa8c4c2444f0c2e1f69a6fb7606685aedf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+IU//xPX/SnSM2Vi62gXKtgg7bu6t6Gl/PaWCKaNF0cZusgZjcvbkSO97XVN88lq8pW+ddUxLz8D7zHug/BVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:56:58.234972Z","bundle_sha256":"2be76acd8fa5171be16b640e9b5d8ca96074ab62294c7a6c77a08ae33a93911e"}}