{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z5JC22RE4T6IU3EZ2ESNKE2JBR","short_pith_number":"pith:Z5JC22RE","schema_version":"1.0","canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","source":{"kind":"arxiv","id":"1801.08043","version":1},"attestation_state":"computed","paper":{"title":"Toll number of the strong product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Polona Repolusk, Tanja Gologranc","submitted_at":"2018-01-23T11:22:39Z","abstract_excerpt":"A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\\in V(G)$ is a set $T_G(u,v)=\\{x\\in V(G)~|~x \\textrm{ lies on a tolled walk between } u \\textrm{\\, and\\,} v\\}$. A set $S \\subseteq V(G)$ is toll convex, if $T_{G}(u,v)\\subseteq S$ for all $u,v\\in S$. A toll closure of a set $S \\subseteq V(G)$ is the union of toll intervals between all pairs of vertices from $S$. The size of a smallest set $S$ whose toll closur"},"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":"1801.08043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-23T11:22:39Z","cross_cats_sorted":[],"title_canon_sha256":"17d56ed82ca56cf99dd040cfd5a2b069a6f68d66a840c5b5e01743e23c7a4309","abstract_canon_sha256":"72acf1abb0b792033e680b18e6c4fe3b73a4d30c78c1d6a6391a646d1d6a729b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:08.455651Z","signature_b64":"MIoxOSFbQJEfiuMzwoxdjFyLpnyWmo4rEAU4qFGh+ukhq8mDvQJ1tNslijS1HPuu8tsmrpuA8nXq6HqueHzPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf522d6a24e4fc8a6c99d124d513490c5968b9696540a5beb42da42edeba5b70","last_reissued_at":"2026-05-18T00:25:08.455000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:08.455000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toll number of the strong product of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Polona Repolusk, Tanja Gologranc","submitted_at":"2018-01-23T11:22:39Z","abstract_excerpt":"A tolled walk $T$ between two non-adjacent vertices $u$ and $v$ in a graph $G$ is a walk, in which $u$ is adjacent only to the second vertex of $T$ and $v$ is adjacent only to the second-to-last vertex of $T$. A toll interval between $u,v\\in V(G)$ is a set $T_G(u,v)=\\{x\\in V(G)~|~x \\textrm{ lies on a tolled walk between } u \\textrm{\\, and\\,} v\\}$. A set $S \\subseteq V(G)$ is toll convex, if $T_{G}(u,v)\\subseteq S$ for all $u,v\\in S$. A toll closure of a set $S \\subseteq V(G)$ is the union of toll intervals between all pairs of vertices from $S$. The size of a smallest set $S$ whose toll closur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.08043","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":"1801.08043","created_at":"2026-05-18T00:25:08.455107+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.08043v1","created_at":"2026-05-18T00:25:08.455107+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.08043","created_at":"2026-05-18T00:25:08.455107+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5JC22RE4T6I","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5JC22RE4T6IU3EZ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5JC22RE","created_at":"2026-05-18T12:33:04.347982+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/Z5JC22RE4T6IU3EZ2ESNKE2JBR","json":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR.json","graph_json":"https://pith.science/api/pith-number/Z5JC22RE4T6IU3EZ2ESNKE2JBR/graph.json","events_json":"https://pith.science/api/pith-number/Z5JC22RE4T6IU3EZ2ESNKE2JBR/events.json","paper":"https://pith.science/paper/Z5JC22RE"},"agent_actions":{"view_html":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR","download_json":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR.json","view_paper":"https://pith.science/paper/Z5JC22RE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.08043&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5JC22RE4T6IU3EZ2ESNKE2JBR/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5JC22RE4T6IU3EZ2ESNKE2JBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/action/storage_attestation","attest_author":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/action/author_attestation","sign_citation":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/action/citation_signature","submit_replication":"https://pith.science/pith/Z5JC22RE4T6IU3EZ2ESNKE2JBR/action/replication_record"}},"created_at":"2026-05-18T00:25:08.455107+00:00","updated_at":"2026-05-18T00:25:08.455107+00:00"}