{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UCWZTBTU2JQEV7YWFYGEHOW2CW","short_pith_number":"pith:UCWZTBTU","schema_version":"1.0","canonical_sha256":"a0ad998674d2604aff162e0c43bada15ae7304c36fb7a6f414fd877568641606","source":{"kind":"arxiv","id":"1601.02896","version":2},"attestation_state":"computed","paper":{"title":"Cycle bases of reduced powers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory D. Smith, Richard H. Hammack","submitted_at":"2016-01-12T15:08:52Z","abstract_excerpt":"We define what appears to be a new construction. Given a graph $G$ and a positive integer $k$, the reduced $k$th power of $G$, denoted $G^{(k)}$, is the configuration space in which $k$ indistinguishable tokens are placed on the vertices of $G$, so that any vertex can hold up to $k$ tokens. Two configurations are adjacent if one can be transformed to the other by moving a single token along an edge to an adjacent vertex.\n  The reduced power $G^{(k)}$ is the transition graph of the master Markov chain for $k$ identical and indistinguishable stochastic automata with transition graph $G$. We pres"},"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":"1601.02896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-12T15:08:52Z","cross_cats_sorted":[],"title_canon_sha256":"24a37a2716334eceb5197a990d233cbe27fe3c4fced1a1a128adf74e30e93653","abstract_canon_sha256":"c6bf0a31c5c4483dfa0d3511765572f5474c932369628a935d1ca91063c51865"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:50.202303Z","signature_b64":"waz/OwuGZfuh5hQJ7NI83QplDZ7cIw1kvvcgNmtOwK4UhEWJEEqwu+ephuCJfk6UrW4XAtpXEPEFJVkaUxuyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0ad998674d2604aff162e0c43bada15ae7304c36fb7a6f414fd877568641606","last_reissued_at":"2026-05-18T01:04:50.201908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:50.201908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle bases of reduced powers of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregory D. Smith, Richard H. Hammack","submitted_at":"2016-01-12T15:08:52Z","abstract_excerpt":"We define what appears to be a new construction. Given a graph $G$ and a positive integer $k$, the reduced $k$th power of $G$, denoted $G^{(k)}$, is the configuration space in which $k$ indistinguishable tokens are placed on the vertices of $G$, so that any vertex can hold up to $k$ tokens. Two configurations are adjacent if one can be transformed to the other by moving a single token along an edge to an adjacent vertex.\n  The reduced power $G^{(k)}$ is the transition graph of the master Markov chain for $k$ identical and indistinguishable stochastic automata with transition graph $G$. We pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02896","kind":"arxiv","version":2},"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":"1601.02896","created_at":"2026-05-18T01:04:50.201962+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.02896v2","created_at":"2026-05-18T01:04:50.201962+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02896","created_at":"2026-05-18T01:04:50.201962+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCWZTBTU2JQE","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCWZTBTU2JQEV7YW","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCWZTBTU","created_at":"2026-05-18T12:30:46.583412+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/UCWZTBTU2JQEV7YWFYGEHOW2CW","json":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW.json","graph_json":"https://pith.science/api/pith-number/UCWZTBTU2JQEV7YWFYGEHOW2CW/graph.json","events_json":"https://pith.science/api/pith-number/UCWZTBTU2JQEV7YWFYGEHOW2CW/events.json","paper":"https://pith.science/paper/UCWZTBTU"},"agent_actions":{"view_html":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW","download_json":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW.json","view_paper":"https://pith.science/paper/UCWZTBTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.02896&json=true","fetch_graph":"https://pith.science/api/pith-number/UCWZTBTU2JQEV7YWFYGEHOW2CW/graph.json","fetch_events":"https://pith.science/api/pith-number/UCWZTBTU2JQEV7YWFYGEHOW2CW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW/action/storage_attestation","attest_author":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW/action/author_attestation","sign_citation":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW/action/citation_signature","submit_replication":"https://pith.science/pith/UCWZTBTU2JQEV7YWFYGEHOW2CW/action/replication_record"}},"created_at":"2026-05-18T01:04:50.201962+00:00","updated_at":"2026-05-18T01:04:50.201962+00:00"}