{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WDV27GBCN7DKZCBOV4W7C4VOVY","short_pith_number":"pith:WDV27GBC","schema_version":"1.0","canonical_sha256":"b0ebaf98226fc6ac882eaf2df172aeae3e41c486e89ffd6890e055dc23a0184a","source":{"kind":"arxiv","id":"1610.09888","version":1},"attestation_state":"computed","paper":{"title":"$E$-restricted double traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Archdeacon, Jernej Rus, Luis Goddyn","submitted_at":"2016-10-31T12:13:10Z","abstract_excerpt":"For a graph $G$ and $E \\subseteq E(G)$, $E$-restricted strong trace is a closed walk which traverses every edge from $E$ once in each direction and every other edge twice in the same direction. In addition, every time a strong trace come to a vertex $v$ from $N \\subseteq N(v)$ it continues to $u \\notin N$, for $1 \\leq |N| < d(v)$. We characterize graphs admitting $E$-restricted strong traces and explain how this result can be used as an upgrade of mathematical model for self-assembling nanostructure design first presented by Gradi\\v{s}ar et al. in [Design of a single-chain polypeptide tetrahed"},"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":"1610.09888","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-31T12:13:10Z","cross_cats_sorted":[],"title_canon_sha256":"e2b36b761c16f27b2cdc2a53f7cab708486286d949c604efa21c588f2feea552","abstract_canon_sha256":"9460a9f44ae52d8cf4061cdf13b394d1e5302ec3aa5e8a86aaab6b479b0b9c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:46.970688Z","signature_b64":"lzV/yOY2G3/z4S0X4xzwMdlkIV/KGhHuGA7Wh3vfMM8Gp2DCEbHcua/CJD5bZnsMKfiayUNXMVJBjNys4nBoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0ebaf98226fc6ac882eaf2df172aeae3e41c486e89ffd6890e055dc23a0184a","last_reissued_at":"2026-05-18T01:00:46.970228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:46.970228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$E$-restricted double traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Archdeacon, Jernej Rus, Luis Goddyn","submitted_at":"2016-10-31T12:13:10Z","abstract_excerpt":"For a graph $G$ and $E \\subseteq E(G)$, $E$-restricted strong trace is a closed walk which traverses every edge from $E$ once in each direction and every other edge twice in the same direction. In addition, every time a strong trace come to a vertex $v$ from $N \\subseteq N(v)$ it continues to $u \\notin N$, for $1 \\leq |N| < d(v)$. We characterize graphs admitting $E$-restricted strong traces and explain how this result can be used as an upgrade of mathematical model for self-assembling nanostructure design first presented by Gradi\\v{s}ar et al. in [Design of a single-chain polypeptide tetrahed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09888","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":"1610.09888","created_at":"2026-05-18T01:00:46.970308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09888v1","created_at":"2026-05-18T01:00:46.970308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09888","created_at":"2026-05-18T01:00:46.970308+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDV27GBCN7DK","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDV27GBCN7DKZCBO","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDV27GBC","created_at":"2026-05-18T12:30:48.956258+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/WDV27GBCN7DKZCBOV4W7C4VOVY","json":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY.json","graph_json":"https://pith.science/api/pith-number/WDV27GBCN7DKZCBOV4W7C4VOVY/graph.json","events_json":"https://pith.science/api/pith-number/WDV27GBCN7DKZCBOV4W7C4VOVY/events.json","paper":"https://pith.science/paper/WDV27GBC"},"agent_actions":{"view_html":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY","download_json":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY.json","view_paper":"https://pith.science/paper/WDV27GBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09888&json=true","fetch_graph":"https://pith.science/api/pith-number/WDV27GBCN7DKZCBOV4W7C4VOVY/graph.json","fetch_events":"https://pith.science/api/pith-number/WDV27GBCN7DKZCBOV4W7C4VOVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY/action/storage_attestation","attest_author":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY/action/author_attestation","sign_citation":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY/action/citation_signature","submit_replication":"https://pith.science/pith/WDV27GBCN7DKZCBOV4W7C4VOVY/action/replication_record"}},"created_at":"2026-05-18T01:00:46.970308+00:00","updated_at":"2026-05-18T01:00:46.970308+00:00"}