{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VAVR6IP5JJHU7MZMG3UI46VALY","short_pith_number":"pith:VAVR6IP5","schema_version":"1.0","canonical_sha256":"a82b1f21fd4a4f4fb32c36e88e7aa05e0ae114eb87de5a4d7e5fb333fe1e5cae","source":{"kind":"arxiv","id":"1405.5922","version":3},"attestation_state":"computed","paper":{"title":"Ionescu's theorem for higher rank graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OA","authors_text":"Adam Morgan, John Quigg, S. Kaliszewski","submitted_at":"2014-05-22T22:12:02Z","abstract_excerpt":"We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of these constructions further and make contact with Yeend's topological k-graphs and the tensor groupoid valued product systems of Fowler and Sims."},"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":"1405.5922","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OA","submitted_at":"2014-05-22T22:12:02Z","cross_cats_sorted":[],"title_canon_sha256":"caeaa48e6b31d4bf63c9dbc1077e4079236a3e47d0dbe9c182cdd09b74bfdb2b","abstract_canon_sha256":"d1b2ff3151dff401c5e4e6248d857a2e184abd97fbad790be5c2de7c8f374095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:18.505731Z","signature_b64":"Nlou3fmkoVEqYbv8YkqKlZ4E3y0NlvbzBcO0UzUVwvuTUm4e+EKoUyvvG4NpSiOuQy6Aqsy1S2pqiCoOgRpWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a82b1f21fd4a4f4fb32c36e88e7aa05e0ae114eb87de5a4d7e5fb333fe1e5cae","last_reissued_at":"2026-05-18T01:25:18.505181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:18.505181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ionescu's theorem for higher rank graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OA","authors_text":"Adam Morgan, John Quigg, S. Kaliszewski","submitted_at":"2014-05-22T22:12:02Z","abstract_excerpt":"We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of these constructions further and make contact with Yeend's topological k-graphs and the tensor groupoid valued product systems of Fowler and Sims."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5922","kind":"arxiv","version":3},"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":"1405.5922","created_at":"2026-05-18T01:25:18.505273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5922v3","created_at":"2026-05-18T01:25:18.505273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5922","created_at":"2026-05-18T01:25:18.505273+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAVR6IP5JJHU","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAVR6IP5JJHU7MZM","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAVR6IP5","created_at":"2026-05-18T12:28:52.271510+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/VAVR6IP5JJHU7MZMG3UI46VALY","json":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY.json","graph_json":"https://pith.science/api/pith-number/VAVR6IP5JJHU7MZMG3UI46VALY/graph.json","events_json":"https://pith.science/api/pith-number/VAVR6IP5JJHU7MZMG3UI46VALY/events.json","paper":"https://pith.science/paper/VAVR6IP5"},"agent_actions":{"view_html":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY","download_json":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY.json","view_paper":"https://pith.science/paper/VAVR6IP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5922&json=true","fetch_graph":"https://pith.science/api/pith-number/VAVR6IP5JJHU7MZMG3UI46VALY/graph.json","fetch_events":"https://pith.science/api/pith-number/VAVR6IP5JJHU7MZMG3UI46VALY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY/action/storage_attestation","attest_author":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY/action/author_attestation","sign_citation":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY/action/citation_signature","submit_replication":"https://pith.science/pith/VAVR6IP5JJHU7MZMG3UI46VALY/action/replication_record"}},"created_at":"2026-05-18T01:25:18.505273+00:00","updated_at":"2026-05-18T01:25:18.505273+00:00"}