{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4OXATLJVUEYJRBFULPT2HKUVVZ","short_pith_number":"pith:4OXATLJV","schema_version":"1.0","canonical_sha256":"e3ae09ad35a1309884b45be7a3aa95ae5d637607a1a894702ef0654dcee5639c","source":{"kind":"arxiv","id":"1101.1932","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.1932","created_at":"2026-05-18T04:31:51.396100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1932v1","created_at":"2026-05-18T04:31:51.396100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1932","created_at":"2026-05-18T04:31:51.396100+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OXATLJVUEYJ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OXATLJVUEYJRBFU","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OXATLJV","created_at":"2026-05-18T12:26:20.644004+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/4OXATLJVUEYJRBFULPT2HKUVVZ","json":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ.json","graph_json":"https://pith.science/api/pith-number/4OXATLJVUEYJRBFULPT2HKUVVZ/graph.json","events_json":"https://pith.science/api/pith-number/4OXATLJVUEYJRBFULPT2HKUVVZ/events.json","paper":"https://pith.science/paper/4OXATLJV"},"agent_actions":{"view_html":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ","download_json":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ.json","view_paper":"https://pith.science/paper/4OXATLJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1932&json=true","fetch_graph":"https://pith.science/api/pith-number/4OXATLJVUEYJRBFULPT2HKUVVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4OXATLJVUEYJRBFULPT2HKUVVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/action/storage_attestation","attest_author":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/action/author_attestation","sign_citation":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/action/citation_signature","submit_replication":"https://pith.science/pith/4OXATLJVUEYJRBFULPT2HKUVVZ/action/replication_record"}},"created_at":"2026-05-18T04:31:51.396100+00:00","updated_at":"2026-05-18T04:31:51.396100+00:00"}